{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:52:45Z","timestamp":1742917965032,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675570"},{"type":"electronic","value":"9783540454861"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-45486-1_1","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T21:56:59Z","timestamp":1185919019000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unifying Single-Agent and Two-Player Search"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Schaeffer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aske","family":"Plaat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"1_CR1","unstructured":"V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, 1994."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"S. Amarel. An approach to heuristic problem-solving and theorem proving in the propositional calculus. In J. Hart and S. Takasu, editors, Systems and Computer Science, 1967.","DOI":"10.3138\/9781487592769-010"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","volume":"43","author":"T. Anantharaman","year":"1990","unstructured":"T. Anantharaman, M. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43(1):99\u2013109, 1990.","journal-title":"Artificial Intelligence"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","volume":"12","author":"H. Berliner","year":"1979","unstructured":"H. Berliner. The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence, 12:23\u201340, 1979.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"1_CR5","first-page":"71","volume":"18","author":"M. Buro","year":"1995","unstructured":"M. Buro. ProbCut: A powerful selective extension of the \u03b1\u03b2 algorithm. Journal of the International Computer Chess Association, 18(2):71\u201381, 1995.","journal-title":"Journal of the International Computer Chess Association"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0004-3702(94)90020-5","volume":"65","author":"P. Chakrabarti","year":"1994","unstructured":"P. Chakrabarti. Algorithms for searching explicit AND\/OR graphs and their applications to problem reduction search. Artificial Intelligence, 65(2):329\u2013345, January 1994.","journal-title":"Artificial Intelligence"},{"key":"1_CR7","unstructured":"R. Gasser. Efficiently harnessing computational resources for exhaustive search. PhD thesis, ETH Z\u00fcrich, 1995."},{"key":"1_CR8","unstructured":"G. Goetsch and M. Campbell. Experiments with the null move heuristic. In AAAI Spring Symposium, pages 14\u201318, 1988."},{"key":"1_CR9","first-page":"801","volume":"31","author":"R. Greenblatt","year":"1967","unstructured":"R. Greenblatt, D. Eastlake, and S. Crocker. The Greenblatt chess program. In Fall Joint Computer Conference, volume 31, pages 801\u2013810, 1967.","journal-title":"Fall Joint Computer Conference"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P. Hart","year":"1968","unstructured":"P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics, SSC-4(2):100\u2013107, July 1968.","journal-title":"IEEE Transactions on Systems, Science and Cybernetics"},{"key":"1_CR11","unstructured":"A. Junghanns. New Developments in Single-Agent Search. PhD thesis, University of Alberta, 1999."},{"key":"1_CR12","unstructured":"A. Junghanns and J. Schaeffer. Domain-dependent single-agent search enhancements. In IJCAI-99, pages 570\u2013575, 1999."},{"key":"1_CR13","unstructured":"H. Kaindl, G. Kainz, A. Leeb, and H. Smetana. How to use limited memory in heuristic search. In IJCAI-95, pages 236\u2013242, Montreal, 1995."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"R. Korf. Iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27:97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"key":"1_CR15","doi-asserted-by":"publisher","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, 42:189\u2013211, 1990.","journal-title":"Artificial Intelligence"},{"key":"1_CR16","doi-asserted-by":"publisher","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, 75:347\u2013360, 1995.","journal-title":"Artificial Intelligence"},{"issue":"7","key":"1_CR17","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"T. Marsland","year":"1994","unstructured":"T. Marsland and A. Reinefeld. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701\u2013710, July 1994.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D. McAllester","year":"1988","unstructured":"D. McAllester. Conspiracy numbers for min-max searching. Artificial Intelligence, 35:287\u2013310, 1988.","journal-title":"Artificial Intelligence"},{"key":"1_CR19","unstructured":"A. Newell and H. Simon. Human Problem Solving. Prentice-Hall, 1972."},{"key":"1_CR20","unstructured":"N. Nilsson. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, 1971."},{"key":"1_CR21","unstructured":"J. Pearl. Heuristics. Addison-Wesley, 1984."},{"key":"1_CR22","unstructured":"A. Reinefeld. Complete solution of the eight-puzzle and the benefit of node ordering in IDA*. In IJCAI-93, pages 248\u2013253, Chambery, France, 1993."},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):1203\u20131212, 1989.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1_CR24","unstructured":"J. Scott. A chess-playing program. In Machine Intelligence 4, pages 255\u2013265, 1969."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"D. Slate and L. Atkin. Chess 4.5 \u2014 the Northwestern University chess program. In P.W. Frey, editor, Chess Skill in Man and Machine, pages 82\u2013118, New York, 1977. Springer-Verlag.","DOI":"10.1007\/978-3-662-06239-5_4"},{"key":"1_CR26","unstructured":"L. Taylor and R. Korf. Pruning duplicate nodes in depth-first search. In AAAI-93, pages 756\u2013761, 1993."},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0004-3702(94)00047-6","volume":"79","author":"W. Zhang","year":"1996","unstructured":"W. Zhang and R. Korf. Performance of linear-space search algorithms. Artificial Intelligence, 79(2):241\u2013292, 1996.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45486-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:18:55Z","timestamp":1558469935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45486-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675570","9783540454861"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45486-1_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"19 May 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}