{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:29:53Z","timestamp":1742920193498,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_38","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"484-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Backgammon Is Hard"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3096-3767","authenticated-orcid":false,"given":"R. Teal","family":"Witter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2017.02.024","volume":"675","author":"JF Baffier","year":"2017","unstructured":"Baffier, J.F., et al.: Hanabi is NP-hard, even for cheaters who look at their cards. Theoret. Comput. Sci. 675, 43\u201355 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"38_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0004-3702(80)90041-7","volume":"14","author":"HJ Berliner","year":"1980","unstructured":"Berliner, H.J.: Backgammon computer program beats world champion. Artif. Intell. 14(2), 205\u2013220 (1980)","journal-title":"Artif. Intell."},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Bosboom, J., Demaine, E.D., Hesterberg, A., Lynch, J., Waingarten, E.: Mario kart is hard. In: Japanese Conference on Discrete and Computational Geometry and Graphs, pp. 49\u201359. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-48532-4_5","DOI":"10.1007\/978-3-319-48532-4_5"},{"key":"38_CR4","unstructured":"Buchin, K., Hagedoorn, M., Kostitsyna, I., van Mulken, M.: Dots & boxes is pspace-complete. arXiv preprint arXiv:2105.02837 (2021)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Mathematical Foundations of Computer Science 2001","author":"ED Demaine","year":"2001","unstructured":"Demaine, E.D.: Playing games with algorithms: algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18\u201333. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_3"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-10843-2_23","volume-title":"Automata, Languages and Programming","author":"AS Fraenkel","year":"1981","unstructured":"Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for n $$\\times $$ n chess requires time exponential in n. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 278\u2013293. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_23"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Guala, L., Leucci, S., Natale, E.: Bejeweled, candy crush and other match-three games are (NP-) hard. In: 2014 IEEE Conference on Computational Intelligence and Games, pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932866"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. CRC Press, Boca Raton (2009)","DOI":"10.1201\/b10581"},{"key":"38_CR9","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Springer (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"6","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1287\/opre.23.6.1063","volume":"23","author":"EB Keeler","year":"1975","unstructured":"Keeler, E.B., Spencer, J.: Optimal doubling in backgammon. Oper. Res. 23(6), 1063\u20131071 (1975)","journal-title":"Oper. Res."},{"issue":"3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1007417214905","volume":"32","author":"JB Pollack","year":"1998","unstructured":"Pollack, J.B., Blair, A.D.: Co-evolution in the successful learning of backgammon strategy. Mach. Learn. 32(3), 225\u2013240 (1998)","journal-title":"Mach. Learn."},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist pspace-vollst\u00e4ndig. Acta Informatica 15(2), 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"key":"38_CR13","unstructured":"Robson, J.M.: The complexity of go. In: Proceedings of the 9th World Computer Congress on Information Processing 1983, pp. 413\u2013417 (1983)"},{"issue":"2","key":"38_CR14","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/0213018","volume":"13","author":"JM Robson","year":"1984","unstructured":"Robson, J.M.: N by N checkers is Exptime complete. SIAM J. Comput. 13(2), 252\u2013267 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"38_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0208013","volume":"8","author":"LJ Stockmeyer","year":"1979","unstructured":"Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM J. Comput. 8(2), 151\u2013174 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"38_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1162\/neco.1994.6.2.215","volume":"6","author":"G Tesauro","year":"1994","unstructured":"Tesauro, G.: TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Comput. 6(2), 215\u2013219 (1994)","journal-title":"Neural Comput."},{"issue":"1\u20132","key":"38_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(01)00110-2","volume":"134","author":"G Tesauro","year":"2002","unstructured":"Tesauro, G.: Programming backgammon using self-teaching neural nets. Artif. Intell. 134(1\u20132), 181\u2013199 (2002)","journal-title":"Artif. Intell."},{"key":"38_CR19","unstructured":"Thorp, E.O.: Backgammon: the optimal strategy for the pure running game. Optimal Play: Mathematical Studies of Games and Gambling. Institute for the Study of Gambling and Commercial Gaming, University of Nevada, Reno, pp. 237\u2013265 (2007)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:15Z","timestamp":1639354095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}