{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:43:49Z","timestamp":1781329429456,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540612919","type":"print"},{"value":"9783540684503","type":"electronic"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61291-2_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:25:30Z","timestamp":1330273530000},"page":"402-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Searching with pattern databases"],"prefix":"10.1007","author":[{"given":"Joseph C.","family":"Culberson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"32_CR1","unstructured":"J. Culberson and J. Schaeffer. Efficiently Searching the 15-Puzzle, TR 94-08, Department of Computing Science, University of Alberta."},{"key":"32_CR2","volume-title":"Ph.D.","author":"R. Gasser","year":"1994","unstructured":"R. Gasser. Harnessing Computational Resources for Efficient Exhaustive Search. Ph.D., ETH Zurich, Switzerland, December, 1994."},{"issue":"no.3","key":"32_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","volume":"63","author":"O. Hansson","year":"1992","unstructured":"O. Hansson, A. Mayer and M. Yung. Criticizing Solutions to Relaxed Models Yields Powerful Admissible Heuristics. Information Sciences, vol. 63, no. 3, pp. 207\u2013227, 1992.","journal-title":"Information Sciences"},{"key":"32_CR4","unstructured":"W. Holst. Unpublished research, University of Alberta, 1995."},{"key":"32_CR5","unstructured":"E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms, Computer Science Press, 1978."},{"issue":"no.1","key":"32_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"R. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, vol. 27, no. 1, pp. 97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"issue":"no.1","key":"32_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(87)90051-8","volume":"33","author":"R. Korf","year":"1987","unstructured":"R. Korf. Planning as Search: A Quantitative Approach Artificial Intelligence, vol. 33, no. 1, pp. 65\u201388, 1987.","journal-title":"Artificial Intelligence"},{"issue":"no.2\u20133","key":"32_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R. Korf","year":"1990","unstructured":"R. Korf. Real-Time Heuristic Search. Artificial Intelligence, vol. 42, no. 2\u20133, pp. 189\u2013211, 1990.","journal-title":"Artificial Intelligence"},{"issue":"no.1","key":"32_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. Korf","year":"1993","unstructured":"R. Korf. Linear-Space Best-First Search. Artificial Intelligence, vol. 62, no. 1, pp. 41\u201378, 1993.","journal-title":"Artificial Intelligence"},{"issue":"no.2","key":"32_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(95)00017-9","volume":"75","author":"G. Manzini","year":"1995","unstructured":"G. Manzini. BIDA: An Improved Perimeter Search Algorithm Artificial Intelligence, vol. 75, no. 2, pp. 347\u2013360, 1995.","journal-title":"Artificial Intelligence"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D. Ratner","year":"1990","unstructured":"D. Ratner and M. Warmuth. Finding a Shortest Solution for the (N \u00d7 N)-Extension of the 15-Puzzle is Intractable, Journal of Symbolic Computation, vol. 10, pp. 111\u2013137, 1990.","journal-title":"Journal of Symbolic Computation"},{"key":"32_CR12","unstructured":"A. Reinefeld. Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA, International Joint Conference on Artificial Intelligence, pp. 248\u2013253, 1993."},{"key":"32_CR13","unstructured":"A. Reinefeld. Private communication, September, 1993."},{"issue":"no.7","key":"32_CR14","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"A. Reinefeld and T. Marsland. Enhanced Iterative-Deepening Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 7, pp. 701\u2013710, July, 1994.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"no.2\u20133","key":"32_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(92)90074-8","volume":"53","author":"J. Schaeffer","year":"1992","unstructured":"J. Schaeffer, J. Culberson, N. Treloar, B. Knight, P. Lu and D. Szafron. A World Championship Caliber Checkers Program, Artificial Intelligence, vol. 53, no. 2\u20133, pp. 273\u2013290, 1992.","journal-title":"Artificial Intelligence"},{"key":"32_CR16","unstructured":"L. Taylor and R. Korf. Pruning Duplicate Nodes in Depth-First Search, AAAI National Conference, pp. 756\u2013761, 1993."}],"container-title":["Lecture Notes in Computer Science","Advances in Artifical Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61291-2_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:27:40Z","timestamp":1558254460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61291-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612919","9783540684503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61291-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}