{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:25:15Z","timestamp":1774484715401,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865848","type":"print"},{"value":"9783031865855","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-86585-5_7","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:24:30Z","timestamp":1743560670000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compressed Game Solving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5587-5979","authenticated-orcid":false,"given":"Jeffrey","family":"Considine","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"7_CR1","unstructured":"Allis, L.V., van\u00a0den Herik, H.J., Huntjens, M.P.H.: Go-moku solved by new search techniques. In: Proceedings of AAAI Fall Symposium on Games: Planning and Learning, pp.\u00a01\u20139 (1993)"},{"key":"7_CR2","unstructured":"Allis, L.V.: Searching for solutions in games and artificial intelligence (1994)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Allis, V.: A knowledge-based approach of connect-four. Master\u2019s thesis, Department of Mathematics and Computer Science, Vrije Universiteit (1988)","DOI":"10.3233\/ICG-1988-11410"},{"issue":"1\/4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/1967631","volume":"3","author":"CL Bouton","year":"1901","unstructured":"Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 3(1\/4), 35\u201339 (1901)","journal-title":"Ann. Math."},{"key":"7_CR5","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Game-tree properties and MCTS performance. In: Proceedings of the ICJAI Workshop on General Intelligence in Game-Playing Agents (GIGA 2011), pp. 23\u201330 (2011)"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","volume":"31","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. J. Comb. Theory, Ser. A 31(2), 199\u2013214 (1981). https:\/\/doi.org\/10.1016\/0097-3165(81)90016-9","journal-title":"J. Comb. Theory, Ser. A"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gasser, R.: Solving nine men\u2019s morris. Computational Intelligence 12 (1996)","DOI":"10.1111\/j.1467-8640.1996.tb00251.x"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-031-11488-5_14","volume-title":"Advances in Computer Games","author":"D Gomboc","year":"2021","unstructured":"Gomboc, D., Shelton, C.R.: Chess endgame compression via logic minimization. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds.) Advances in Computer Games, pp. 153\u2013162. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-031-11488-5_14"},{"key":"7_CR9","unstructured":"Handsomb, K.: 8x8 game design competition: the winning game: breakthrough... and two other favorites. Abstract Games (2001)"},{"key":"7_CR10","unstructured":"Haugland, J.K.: Breakth37. https:\/\/www.neutreeko.net\/Breakth37.java"},{"key":"7_CR11","unstructured":"Haugland, J.K.: Breakth55. https:\/\/www.neutreeko.net\/Breakth55.java"},{"key":"7_CR12","unstructured":"Irving, G.: Pentago is a first player win: Strongly solving a game using parallel in-core retrograde analysis. CoRR abs\/1404.0743 (2014). http:\/\/arxiv.org\/abs\/1404.0743"},{"key":"7_CR13","unstructured":"Isaac, A.W.: Generating an end game tablebase for the game of breakthrough using quasi-retrograde analysis. Master\u2019s thesis (2016)"},{"key":"7_CR14","unstructured":"Kristensen, J.T.: Generation and compression of endgame tables in chess with fast random access using OBDDs. Master\u2019s thesis, University of Aarhus (2005)"},{"key":"7_CR15","unstructured":"von Neumann, J., Morgenstern, O.: Theory of games and economic behavior (1945)"},{"issue":"4","key":"7_CR16","first-page":"202","volume":"53","author":"O Patashnik","year":"1980","unstructured":"Patashnik, O.: Qubic: 4 $$\\times $$ 4 $$\\times $$ 4 tic-tac-toe. Math. Mag. 53(4), 202\u2013216 (1980)","journal-title":"Math. Mag."},{"key":"7_CR17","first-page":"162","volume":"25","author":"JW Romein","year":"2002","unstructured":"Romein, J.W., Bal, H.E.: Awari is solved. J. Int. Comput. Games Assoc. 25, 162\u2013165 (2002)","journal-title":"J. Int. Comput. Games Assoc."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Saffidine, A., Jouandeau, N., Cazenave, T.: Solving breakthrough with race patterns and job-level proof number search. In: Advances in Computer Games (2011)","DOI":"10.1007\/978-3-642-31866-5_17"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1142\/S1793005708001124","volume":"04","author":"Best play in fanorona leads to draw","year":"2008","unstructured":"Best play in fanorona leads to draw: Schadd, M.P.D., Winands, M.H.M., Uiterwijk, J., H., van den Herik, J., Bergsma, M.H.J. New Math. Nat. Comput. 04, 369\u2013387 (2008)","journal-title":"New Math. Nat. Comput."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. In: Advances in Computer Games (2003)","DOI":"10.1007\/978-0-387-35706-5_13"},{"issue":"5844","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J Schaeffer","year":"2007","unstructured":"Schaeffer, J., et al.: Checkers is solved. Science 317(5844), 1518\u20131522 (2007). https:\/\/doi.org\/10.1126\/science.1144079","journal-title":"Science"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1006\/game.2000.0794","volume":"34","author":"U Schwalbe","year":"2001","unstructured":"Schwalbe, U., Walker, P.: Zermelo and the early history of game theory. Games Econom. Behav. 34(1), 123\u2013137 (2001). https:\/\/doi.org\/10.1006\/game.2000.0794","journal-title":"Games Econom. Behav."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Skowronski, P., Bj\u00f6rnsson, Y., Winands, M.H.M.: Automated discovery of search-extension features. In: Advances in Computer Games (2009)","DOI":"10.1007\/978-3-642-12993-3_17"},{"key":"7_CR24","unstructured":"Takizawa, H.: Othello is solved. ArXiv abs\/2310.19387 (2023)"},{"key":"7_CR25","unstructured":"Turing, A.M.: Proposed electronic calculator. National Report (1946)"},{"key":"7_CR26","unstructured":"de\u00a0Vink, E.: Solving breakthrough using binary decision diagrams and retrograde analysis. Bachelor\u2019s Thesis (2022)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86585-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:24:49Z","timestamp":1743560689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86585-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865848","9783031865855"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86585-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CG 2024","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computers and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3907","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}