{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:20:09Z","timestamp":1752981609565},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430803"},{"type":"electronic","value":"9783540455790"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45579-5_17","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:52:18Z","timestamp":1195217538000},"page":"250-261","source":"Crossref","is-referenced-by-count":7,"title":["Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Buro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"issue":"6","key":"17_CR1","first-page":"12","volume":"14","author":"M. Buro","year":"1999","unstructured":"M. Buro. How machines have learned to play Othello. IEEE Intelligent Systems J.,14(6):12\u201314, 1999.","journal-title":"IEEE Intelligent Systems J."},{"key":"17_CR2","unstructured":"J. Culberson. Sokoban is PSPACE-complete. In Proceedings in Informatics 4, pages 65\u201376. arleton Scientific,Waterloo, Canada, 1999."},{"issue":"1","key":"17_CR3","first-page":"33","volume":"21","author":"D. DeCoste","year":"1998","unstructured":"D. DeCoste. The significance of Kasparov versus Deep Blue and the future of computer chess. ICCA J., 21(1):33\u201343, 1998.","journal-title":"ICCA J."},{"key":"17_CR4","unstructured":"G.W. Flake and E.B. Baum. RushHour is PSPACE-complete, or why you should generously tip parking lot attendants. to appear in TCS, 2000."},{"key":"17_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company NewYork, 1979."},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"A. Itai, C.H. Papadimitriou, and J.L. Szwarcfiter. Hamilton paths in grid graphs. SIAM J. Comput., 11(4):676\u2013686, 1982.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4\u201332, 1996.","journal-title":"Algorithmica"},{"key":"17_CR8","unstructured":"R. Korf. Finding optimal solutions to Rubik\u2019s cube using pattern databases. Fourteenth National Conference on Artificial Intelligence Ninth Innovative Applications of Artificial Intelligence Conference, pages 700\u2013705, 1997."},{"issue":"2","key":"17_CR9","first-page":"104","volume":"22","author":"M. M\u00fcller","year":"1999","unstructured":"M. M\u00fcller. Computer Go: A research agenda. ICCA Journal, 22(2):104\u2013112, 1999.","journal-title":"ICCA Journal"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J. Plesnik","year":"1979","unstructured":"J. Plesnik. The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Information Processing Letters, 8(4):199\u2013201, 1979.","journal-title":"Information Processing Letters"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"J. Schaeffer. One Jump Ahead: Challenging Human Supremacy in Checkers. SpringerVerlag, 1997.","DOI":"10.1007\/978-1-4757-2733-3"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45579-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:42:48Z","timestamp":1551094968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45579-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430803","9783540455790"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45579-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}