{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T00:52:13Z","timestamp":1746492733497},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678397"},{"type":"electronic","value":"9783540449140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_3","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T21:26:14Z","timestamp":1179869174000},"page":"45-55","source":"Crossref","is-referenced-by-count":12,"title":["Recent Progress in the Design and Analysis of Admissible Heuristic Functions"],"prefix":"10.1007","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J. Culberson","year":"1998","unstructured":"Culberson, J., and J. Schaeffer. Pattern Databases, Computational Intelligence, Vol. 14, No. 3, 1998, pp. 318\u2013334.","journal-title":"Computational Intelligence"},{"key":"3_CR2","unstructured":"Edelkamp, S. and R.E. Korf, The branching factor of regular search spaces, Proceedings of the National Conference on Artificial Intelligence (AAAI-98), Madison, WI, July, 1998, pp. 299\u2013304."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","volume":"63","author":"O. Hansson","year":"1992","unstructured":"Hansson, O., A. Mayer, and M. Yung, Criticizing solutions to relaxed models yields powerful admissible heuristics, Information Sciences, Vol. 63, No. 3, 1992, pp. 207\u2013227.","journal-title":"Information Sciences"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., N.J. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, Vol. SSC-4, No. 2, July 1968, pp. 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.2307\/2369492","volume":"2","author":"W.W. Johnson","year":"1879","unstructured":"Johnson, W.W. and W.E. Storey, Notes on the 15 puzzle, American Journal of Mathematics, Vol. 2, 1879, pp. 397\u2013404.","journal-title":"American Journal of Mathematics"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E., Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence, Vol. 27, No. 1, 1985, pp. 97\u2013109.","journal-title":"Artificial Intelligence"},{"key":"3_CR7","unstructured":"Korf, R.E., and L.A. Taylor, Finding optimal solutions to the twenty-four puzzle, Proceedings of the National Conference on Artificial Intelligence (AAAI-96), Portland, OR, Aug. 1996, pp. 1202\u20131207."},{"key":"3_CR8","unstructured":"Korf, R.E., Finding optimal solutions to Rubik\u2019s Cube using pattern databases, Proceedings of the National Conference on Artificial Intelligence (AAAI-97), Providence, RI, July, 1997, pp. 700\u2013705."},{"key":"3_CR9","unstructured":"Korf, R.E., and M. Reid, Complexity analysis of admissible heuristic search, Proceedings of the National Conference on Artificial Intelligence (AAAI-98), Madison, WI, July, 1998, pp. 305\u2013310."},{"key":"3_CR10","volume-title":"Mathematical Puzzles of Sam Loyd","author":"S. Loyd","year":"1959","unstructured":"Loyd, S., Mathematical Puzzles of Sam Loyd, selected and edited by Martin Gardner, Dover, New York, 1959."},{"key":"3_CR11","volume-title":"J. Heuristics","author":"Pearl","year":"1984","unstructured":"Pearl, J. Heuristics, Addison-Wesley, Reading, MA, 1984."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:58:09Z","timestamp":1550354289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}