{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:51:49Z","timestamp":1743562309013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031114878"},{"type":"electronic","value":"9783031114885"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-11488-5_14","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:38:26Z","timestamp":1659364706000},"page":"153-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Chess Endgame Compression via\u00a0Logic Minimization"],"prefix":"10.1007","author":[{"given":"Dave","family":"Gomboc","sequence":"first","affiliation":[]},{"given":"Christian R.","family":"Shelton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1070\/rm1970v025n02abeh003792","volume":"25","author":"GM Adel\u2019son-Vel\u2019skii","year":"1970","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Arlazarov, V.L., Bitman, A.R., Zhivotovskii, A.A., Uskov, A.V.: Programming a computer to play chess. Russ. Math. Surv. 25(2), 221\u2013262 (1970). https:\/\/doi.org\/10.1070\/rm1970v025n02abeh003792","journal-title":"Russ. Math. Surv."},{"key":"14_CR2","unstructured":"Allis, L., van der Meulen, M., van den Herik, H.: Databases in awari. In: Levy, D., Beal, D. (eds.) Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad, Ellis Horwood, pp. 73\u201386 (1991)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Amar\u00fa, L., Gaillardon, P., Burg, A., De Micheli, G.: Data compression via logic synthesis. In: Nineteenth Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 628\u2013633 (2014)","DOI":"10.1109\/ASPDAC.2014.6742961"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0165-1684(95)00047-H","volume":"44","author":"J Augustine","year":"1995","unstructured":"Augustine, J., Feng, W., Makur, A., Jacob, J.: Switching theoretic approach to image compression. Sig. Process. 44(2), 243\u2013246 (1995). https:\/\/doi.org\/10.1016\/0165-1684(95)00047-H","journal-title":"Sig. Process."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1073\/pnas.53.2.244","volume":"53","author":"R Bellman","year":"1965","unstructured":"Bellman, R.: On the application of dynamic programing to the determination of optimal play in chess and checkers. Proc. Natl. Acad. Sci. U.S.A. 53(2), 244 (1965)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6","volume-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"RK Brayton","year":"1984","unstructured":"Brayton, R.K., Sangiovanni-Vincentelli, A.L., McMullen, C.T., Hachtel, G.D.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Norwell (1984)"},{"issue":"8","key":"14_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"1\u20132","key":"14_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M Campbell","year":"2002","unstructured":"Campbell, M., Hoane, A.J., Jr., Hsu, F.H.: Deep blue. Artif. Intell. 134(1\u20132), 57\u201383 (2002). https:\/\/doi.org\/10.1016\/S0004-3702(01)00129-1","journal-title":"Artif. Intell."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0167-9260(94)00007-7","volume":"17","author":"O Coudert","year":"1994","unstructured":"Coudert, O.: Two-level logic minimization: an overview. Integr. VLSI J. 17(2), 97\u2013140 (1994). https:\/\/doi.org\/10.1016\/0167-9260(94)00007-7","journal-title":"Integr. VLSI J."},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(3), 318\u2013334 (1998). https:\/\/doi.org\/10.1111\/0824-7935.00065","journal-title":"Comput. Intell."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02781787","volume":"21","author":"RP Damodare","year":"1996","unstructured":"Damodare, R.P., Augustine, J., Jacob, J.: Lossless and lossy image compression using Boolean function minimization. Sadhana 21(1), 55\u201364 (1996). https:\/\/doi.org\/10.1007\/BF02781787","journal-title":"Sadhana"},{"key":"14_CR12","unstructured":"Edelkamp, S., Kissmann, P.: On the complexity of BDDs for state space search: a case study in connect four. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, 7\u201311 August 2011. AAAI Press (2011). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI11\/paper\/view\/3690"},{"key":"14_CR13","unstructured":"Falsinelli, B., Dart, J., de Man, R.: Fathom (2015). https:\/\/github.com\/jdart1\/Fathom"},{"key":"14_CR14","unstructured":"Fi\u0161er, P., Hlavi\u010dka, J.: Implicant expansion methods used in the BOOM minimizer (2001)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Fi\u0161er, P., Ruck\u00fd, P., V\u00e1\u0148ov\u00e1, I.: Fast Boolean minimizer for completely specified functions, pp. 122\u2013127 (2008)","DOI":"10.1109\/DDECS.2008.4538768"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Fi\u0161er, P., Toman, D.: A fast SOP minimizer for logic functions described by many product terms, pp. 757\u2013764 (2009)","DOI":"10.1109\/DSD.2009.157"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1111\/j.1467-8640.1996.tb00251.x","volume":"12","author":"R Gasser","year":"1996","unstructured":"Gasser, R.: Solving nine men\u2019s morris. Comput. Intell. 12(1), 24\u201341 (1996). https:\/\/doi.org\/10.1111\/j.1467-8640.1996.tb00251.x","journal-title":"Comput. Intell."},{"issue":"1","key":"14_CR18","first-page":"22","volume":"22","author":"E Heinz","year":"1999","unstructured":"Heinz, E.: Endgame databases and efficient index schemes for chess. J. Int. Comput. Games Assoc. 22(1), 22\u201332 (1999)","journal-title":"J. Int. Comput. Games Assoc."},{"issue":"2","key":"14_CR19","first-page":"66","volume":"8","author":"H van den Herik","year":"1985","unstructured":"van den Herik, H., Herschberg, I.: The construction of an omniscient endgame data base. J. Int. Comput. Chess Assoc. 8(2), 66\u201387 (1985)","journal-title":"J. Int. Comput. Chess Assoc."},{"issue":"5","key":"14_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1147\/rd.185.0443","volume":"18","author":"SJ Hong","year":"1974","unstructured":"Hong, S.J., Cain, R.G., Ostapko, D.L.: MINI: a heuristic approach for logic minimization. IBM J. Res. Dev. 18(5), 443\u2013458 (1974). https:\/\/doi.org\/10.1147\/rd.185.0443","journal-title":"IBM J. Res. Dev."},{"key":"14_CR21","unstructured":"killrducky: TB rescoring (2018). https:\/\/blog.lczero.org\/2018\/09\/tb-rescoring.html"},{"key":"14_CR22","unstructured":"de Man, R.: Syzygy (2020). https:\/\/github.com\/syzygy1\/tb"},{"issue":"3","key":"14_CR23","first-page":"148","volume":"23","author":"EV Nalimov","year":"2000","unstructured":"Nalimov, E.V., Haworth, G.M., Heinz, E.A.: Space-efficient indexing of chess endgame tables. J. Int. Comput. Games Assoc. 23(3), 148\u2013162 (2000)","journal-title":"J. Int. Comput. Games Assoc."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J v. Neumann","year":"1928","unstructured":"v. Neumann, J.: Zur theorie der gesellschaftsspiele (\u201cOn the theory of parlor games\u2019\u2019). Math. Ann. (\u201cMath. Ann.\u2019\u2019) 100, 295\u2013320 (1928). https:\/\/doi.org\/10.1007\/BF01448847","journal-title":"Math. Ann. (\u201cMath. Ann.\u201d)"},{"issue":"4","key":"14_CR25","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1147\/rd.24.0320","volume":"2","author":"A Newell","year":"1958","unstructured":"Newell, A., Shaw, J.C., Simon, H.A.: Chess-playing programs and the problem of complexity. IBM J. Res. Dev. 2(4), 320\u2013335 (1958). https:\/\/doi.org\/10.1147\/rd.24.0320","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"14_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1080\/0025570X.1980.11976855","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). https:\/\/doi.org\/10.1080\/0025570X.1980.11976855","journal-title":"Math. Mag."},{"key":"14_CR27","series-title":"Symbolic Computation","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-12405-5_15","volume-title":"Machine Learning: An Artificial Intelligence Approach","author":"JR Quinlan","year":"1983","unstructured":"Quinlan, J.R.: Learning efficient classification procedures and their application to chess end games. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.) Machine Learning: An Artificial Intelligence Approach. Symbolic Computation, vol. 1064, pp. 463\u2013482. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-662-12405-5_15"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-09165-5_16","volume-title":"Computers and Games","author":"A Saffidine","year":"2014","unstructured":"Saffidine, A., Jouandeau, N., Buron, C., Cazenave, T.: Material symmetry to partition endgame tables. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 187\u2013198. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09165-5_16"},{"issue":"8","key":"14_CR29","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/0167-8655(96)00045-1","volume":"17","author":"D Sarkar","year":"1996","unstructured":"Sarkar, D.: Boolean function-based approach for encoding of binary images. Pattern Recogn. Lett. 17(8), 839\u2013848 (1996). https:\/\/doi.org\/10.1016\/0167-8655(96)00045-1","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Schaeffer, J., et al.: Checkers is solved. Science 317(5844), 1518\u20131522 (2007). https:\/\/doi.org\/10.1126\/science.1144079. https:\/\/science.sciencemag.org\/content\/317\/5844\/1518","DOI":"10.1126\/science.1144079"},{"issue":"2","key":"14_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1038\/scientificamerican0250-48","volume":"182","author":"CE Shannon","year":"1950","unstructured":"Shannon, C.E.: A chess-playing machine. Sci. Am. 182(2), 48\u201351 (1950). https:\/\/doi.org\/10.1038\/scientificamerican0250-48","journal-title":"Sci. Am."},{"issue":"6419","key":"14_CR32","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D., et al.: A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science 362(6419), 1140\u20131144 (2018). https:\/\/doi.org\/10.1126\/science.aar6404","journal-title":"Science"},{"issue":"2","key":"14_CR33","first-page":"55","volume":"12","author":"L Stiller","year":"1989","unstructured":"Stiller, L.: Parallel analysis of certain endgames. J. Int. Comput. Chess Assoc. 12(2), 55\u201364 (1989)","journal-title":"J. Int. Comput. Chess Assoc."},{"issue":"2\u20133","key":"14_CR34","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00127839","volume":"5","author":"L Stiller","year":"1991","unstructured":"Stiller, L.: Group graphs and computational symmetry on massively parallel architecture. J. Supercomput. 5(2\u20133), 99\u2013117 (1991). https:\/\/doi.org\/10.1007\/BF00127839","journal-title":"J. Supercomput."},{"key":"14_CR35","unstructured":"Stiller, L.: Multilinear algebra and chess endgames. In: Games of on Chance, vol. 29, pp. 151\u2013192 (1996)"},{"key":"14_CR36","unstructured":"Str\u00f6hlein, T.: Untersuchungen \u00fcber Kombinatorische Spiele (\u201cInvestigations on combinatorial games\u201d). Ph.D. thesis, Fakult\u00e4t f\u00fcr Allgemeine Wissenschaften der Technische Hochschule M\u00fcnchen (\u201cFaculty of General Sciences of Munich Technical University\u201d) (1970)"},{"issue":"3","key":"14_CR37","first-page":"131","volume":"9","author":"K Thompson","year":"1986","unstructured":"Thompson, K.: Retrograde analysis of certain endgames. J. Int. Comput. Chess Assoc. 9(3), 131\u2013139 (1986)","journal-title":"J. Int. Comput. Chess Assoc."},{"key":"14_CR38","unstructured":"Turing, A.M.: Digital computers applied to games. Faster than Thought (1953)"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Yang, J., Savari, S.A., Mencercv, O.: Lossless compression using two-level and multilevel Boolean minimization. In: 2006 IEEE Workshop on Signal Processing Systems Design and Implementation, pp. 148\u2013152 (2006)","DOI":"10.1109\/SIPS.2006.352571"},{"key":"14_CR40","first-page":"34","volume":"15","author":"V Zakharov","year":"2013","unstructured":"Zakharov, V., Maknhychev, V.: Creating tables of chess 7-piece endgames on the Lomonosov supercomputer. Superkomp\u2019yutery (\u201cSupercomputers\u2019\u2019) 15, 34\u201337 (2013)","journal-title":"Superkomp\u2019yutery (\u201cSupercomputers\u201d)"},{"key":"14_CR41","unstructured":"Zermelo, E.: \u00dcber eine anwendung der mengenlehre auf die theorie des schachspiels (\u201cOn an application of set theory to the theory of the game of chess\"). In: Proceedings of the Fifth International Congress of Mathematicians, vol. 2, pp. 501\u2013504 (1913)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-11488-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:40:40Z","timestamp":1659364840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-11488-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031114878","9783031114885"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-11488-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Advances in Computer Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3328","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"34","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":"22","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":"0","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":"65% - 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":"3","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.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}