{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:17Z","timestamp":1725483857030},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657668"},{"type":"electronic","value":"9783540489573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48957-6_1","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T14:16:09Z","timestamp":1178374569000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Relevance Cuts: Localizing the Search"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Junghanns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0004-3702(75)90021-1","volume":"6","author":"G. Adelson-Velskiy","year":"1975","unstructured":"G. Adelson-Velskiy, V. Arlazarov, and M. Donskoy. Some methods of controlling the tree search in chess programs. Artificial Intelligence, 6(4):361\u2013371, 1975.","journal-title":"Artificial Intelligence"},{"key":"1_CR2","volume-title":"Technical Report TR97-02","author":"J. Culberson","year":"1997","unstructured":"J. Culberson. Sokoban is PSPACE-complete. Technical Report TR97-02, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, 1997. ftp:\/\/ftp.cs.ualberta.ca\/pub\/TechReports\/1997\/TR97-02 ."},{"key":"1_CR3","unstructured":"D. Dor and U. Zwick. SOKOBAN and other motion planning problems, 1995. At: http:\/\/www.math.tau.ac.il\/~ddorit ."},{"key":"1_CR4","volume-title":"Essentials in Artificial Intelligence","author":"M. Ginsberg","year":"1993","unstructured":"M. Ginsberg. Essentials in Artificial Intelligence. Morgan Kaufman Publishers, San Francisco, 1993."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"G. Goetsch and M.S. Campbell. Experiments with the null-move heuristic. In T.A. Marsland and J. Schaeffer, editors, Computers, Chess, and Cognition, pages 159\u2013181, New York, 1990. Springer-Verlag.","DOI":"10.1007\/978-1-4613-9080-0_9"},{"key":"1_CR6","unstructured":"A. Junghanns and J. Schaeffer. Single-agent search in the presence of deadlock. In AAAI-98, pages 419\u2013424, Madison\/WI, USA, July 1998."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"A. Junghanns and J. Schaeffer. Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock. In Advances in Artificial Intelligence, pages 1\u201315. Springer Verlag, 1998.","DOI":"10.1007\/3-540-64575-6_36"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"R.E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0004-3702(85)90012-8","volume":"26","author":"R.E. Korf","year":"1985","unstructured":"R.E. Korf. Macro-operators: A weak method for learning. Artificial Intelligence, 26(1):35\u201377, 1985.","journal-title":"Artificial Intelligence"},{"key":"1_CR10","unstructured":"R.E. Korf. Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In AAAI-97, pages 700\u2013705, 1997."},{"key":"1_CR11","series-title":"PhD thesis","volume-title":"Experiments in Search and Knowledge","author":"J. Schaeffer","year":"1986","unstructured":"J. Schaeffer. Experiments in Search and Knowledge. PhD thesis, Univ. of Waterloo, Canada, 1986."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"G. Wilfong. Motion planning in the presence of movable obstacles. In 4th ACM Symposium on Computational Geometry, pages 279\u2013288, 1988.","DOI":"10.1145\/73393.73422"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48957-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:43:34Z","timestamp":1556390614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48957-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657668","9783540489573"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48957-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}