{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T16:37:27Z","timestamp":1775925447509,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0004-3702(95)00096-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"299-337","source":"Crossref","is-referenced-by-count":39,"title":["Best-first minimax search"],"prefix":"10.1016","volume":"84","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[]},{"given":"David Maxwell","family":"Chickering","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00096-8_BIB1","article-title":"A statistical study of selective min-max search in computer chess","author":"Anantharaman","year":"1990"},{"key":"10.1016\/0004-3702(95)00096-8_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","article-title":"Singular extensions: Adding selectivity to brute-force searching","volume":"43","author":"Anantharaman","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","article-title":"The B\u2217 tree search algorithm: A best-first proof procedure","volume":"12","author":"Berliner","year":"1979","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","article-title":"Heuristic search in restricted memory","volume":"41","author":"Chakrabarti","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB5","article-title":"An analysis of the alpha-beta pruning algorithm","author":"Fuller","year":"1973"},{"key":"10.1016\/0004-3702(95)00096-8_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0004-3702(74)90014-9","article-title":"The heuristic search under conditions of error","volume":"5","author":"Harris","year":"1974","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB7","series-title":"Proceedings IJCAI-83","first-page":"760","article-title":"Searching to variable depth in computer chess","author":"Kaindl","year":"1983"},{"key":"10.1016\/0004-3702(95)00096-8_BIB8","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/34.106996","article-title":"Minimax search algorithms with and without aspiration windows","volume":"13","author":"Kaindl","year":"1991","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(83)80006-X","article-title":"Searching for an optimal path in a tree with random costs","volume":"21","author":"Karp","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB10","author":"Keene","year":"1996"},{"key":"10.1016\/0004-3702(95)00096-8_BIB11","first-page":"46","author":"Kernighan","year":"1988"},{"key":"10.1016\/0004-3702(95)00096-8_BIB12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB13","article-title":"Best-first minimax search: Initial results","author":"Korf","year":"1992"},{"key":"10.1016\/0004-3702(95)00096-8_BIB14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","article-title":"Linear-space best-first search","volume":"62","author":"Korf","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB15","series-title":"Proceedings AAAI Fall Symposium on Games: Planning and Learning","first-page":"39","article-title":"Best-first minimax search: first results","author":"Korf","year":"1993"},{"key":"10.1016\/0004-3702(95)00096-8_BIB16","series-title":"Proceedings AAAI-94","first-page":"1365","article-title":"Best-first minimax: Othello results","author":"Korf","year":"1994"},{"key":"10.1016\/0004-3702(95)00096-8_BIB17","series-title":"Proceedings AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods","first-page":"15","article-title":"Incremental random search trees","author":"Korf","year":"1994"},{"key":"10.1016\/0004-3702(95)00096-8_BIB18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/362280.362288","article-title":"COKO III: the Cooper-Koz chess program","volume":"16","author":"Kozdrowicki","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(95)00096-8_BIB19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(90)90068-B","article-title":"The development of a world-class Othello program","volume":"43","author":"Lee","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB20","series-title":"Encyclopedia of Artificial Intelligence","first-page":"224","article-title":"Computer chess and search","author":"Marsland","year":"1992"},{"key":"10.1016\/0004-3702(95)00096-8_BIB21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","article-title":"Conspiracy numbers for min-max search","volume":"35","author":"McAllester","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB22","series-title":"Proceedings IJCAI-91","first-page":"173","article-title":"An expected-cost analysis of backtracking and non-backtracking algorithms","author":"McDiarmid","year":"1991"},{"key":"10.1016\/0004-3702(95)00096-8_BIB23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0004-3702(82)90010-8","article-title":"The last player theorem","volume":"18","author":"Nau","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0004-3702(82)90002-9","article-title":"An investigation of the causes of pathology in games","volume":"19","author":"Nau","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0004-3702(77)90017-0","article-title":"The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores","volume":"8","author":"Newborn","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB26","series-title":"Information Processing 68, Proceedings of the IFIP Congress 1968","first-page":"1556","article-title":"Searching problem-solving and game-playing trees for minimal cost solutions","author":"Nilsson","year":"1969"},{"key":"10.1016\/0004-3702(95)00096-8_BIB27","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00096-8_BIB28","series-title":"Proceedings Second International Conference on Planning","first-page":"140","article-title":"Incremental search algorithms for real-time decision making","author":"Pemberton","year":"1994"},{"key":"10.1016\/0004-3702(95)00096-8_BIB29","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","article-title":"Game tree searching by min\/max approximation","volume":"34","author":"Rivest","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB30","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(82)90003-0","article-title":"A world-championship-level Othello program","volume":"19","author":"Rosenbloom","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB31","series-title":"Proceedings IJCAI-89","first-page":"334","article-title":"On optimal game-tree search using rational meta-reasoning","author":"Russell","year":"1989"},{"key":"10.1016\/0004-3702(95)00096-8_BIB32","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","article-title":"Programming a computer for playing chess","volume":"41","author":"Shannon","year":"1950","journal-title":"Philos. Magazine"},{"key":"10.1016\/0004-3702(95)00096-8_BIB33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321510.321511","article-title":"Experiments with some programs that search game trees","volume":"16","author":"Slagle","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00096-8_BIB34","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than Alpha-Beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00096-8_BIB35","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(94)00047-6","article-title":"Performance of linear-space search algorithms","volume":"79","author":"Zhang","year":"1995","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:57:11Z","timestamp":1555538231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0004370295000968"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00096-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}