{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:35:11Z","timestamp":1771576511202,"version":"3.50.1"},"reference-count":55,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6110,"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,11]]},"DOI":"10.1016\/0004-3702(95)00126-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:20:41Z","timestamp":1027581641000},"page":"255-293","source":"Crossref","is-referenced-by-count":64,"title":["Best-first fixed-depth minimax algorithms"],"prefix":"10.1016","volume":"87","author":[{"given":"Aske","family":"Plaat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Pijls","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"de Bruin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00126-3_BIB1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","article-title":"Proof-number search","volume":"66","author":"Allis","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB2","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)00126-3_BIB3","article-title":"Unified recursive schemes for search in game trees","author":"Bhattacharya","year":"1990"},{"key":"10.1016\/0004-3702(95)00126-3_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(93)90034-7","article-title":"A faster alternative to SSS\u2217 with extension to variable memory","volume":"47","author":"Bhattacharya","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0004-3702(95)00126-3_BIB5","article-title":"Improvements to parallel alpha-beta algorithms","author":"Brockington","year":"1994"},{"issue":"2","key":"10.1016\/0004-3702(95)00126-3_BIB6","first-page":"71","article-title":"ProbCut: a powerful selective extension of the \u03b1\u03b2 algorithm","volume":"18","author":"Buro","year":"1995","journal-title":"ICCA J."},{"key":"10.1016\/0004-3702(95)00126-3_BIB7","article-title":"Algorithms for the parallel search of game trees","author":"Campbell","year":"1981"},{"key":"10.1016\/0004-3702(95)00126-3_BIB8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","article-title":"A comparison of minimax tree search algorithms","volume":"20","author":"Campbell","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB9","first-page":"25","article-title":"A special-purpose machine for an improved search algorithm for deep chess combinations","volume":"3","author":"Coplan","year":"1982"},{"key":"10.1016\/0004-3702(95)00126-3_BIB10","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1994-17404","article-title":"Solution trees as a basis for game tree search","author":"de Bruin","year":"1994"},{"issue":"4","key":"10.1016\/0004-3702(95)00126-3_BIB11","first-page":"207","article-title":"Solution trees as a basis for game-tree search","volume":"17","author":"de Bruin","year":"1994","journal-title":"ICCA J."},{"key":"10.1016\/0004-3702(95)00126-3_BIB12","author":"Ebeling","year":"1987"},{"key":"10.1016\/0004-3702(95)00126-3_BIB13","first-page":"1","article-title":"A fully distributed chess program","volume":"6","author":"Feldmann","year":"1991"},{"key":"10.1016\/0004-3702(95)00126-3_BIB14","article-title":"Analysis of speedup in distributed algorithms","author":"Fishburn","year":"1981"},{"key":"10.1016\/0004-3702(95)00126-3_BIB15","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1990-13206","article-title":"Large scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess","author":"Hsu","year":"1990"},{"key":"10.1016\/0004-3702(95)00126-3_BIB16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","article-title":"Generalization of alpha-beta and SSS\u2217 search procedures","volume":"29","author":"Ibaraki","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB17","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. Patt. Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB18","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)00126-3_BIB19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB20","series-title":"Proceedings AAAI-94","first-page":"1365","article-title":"Best-first minimax search: Othello results","author":"Korf","year":"1994"},{"key":"10.1016\/0004-3702(95)00126-3_BIB21","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/TPAMI.1984.4767600","article-title":"Parallel branch-and-bound formulations for AND\/OR tree search","volume":"6","author":"Kumar","year":"1984","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8788-6_3","article-title":"A general branch and bound formulation for and\/or graph and game tree search","author":"Kumar","year":"1988"},{"key":"10.1016\/0004-3702(95)00126-3_BIB23","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/356893.356895","article-title":"Parallel search of strongly ordered game trees","volume":"14","author":"Marsland","year":"1982","journal-title":"Comput. Surveys"},{"key":"10.1016\/0004-3702(95)00126-3_BIB24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS\u2217","volume":"31","author":"Marsland","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","article-title":"Conspiracy numbers for min-max searching","volume":"35","author":"McAllester","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB26","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TSMC.1985.6313374","article-title":"An empirical comparison of pruning strategies in game trees","volume":"15","author":"Muszycka","year":"1985","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/0004-3702(95)00126-3_BIB27","series-title":"Heuristic Programming in Artificial Intelligence\u2014The First Computer Olympiad","first-page":"255","article-title":"Best-move-proving: a fast game-tree searching program","author":"Nagl","year":"1989"},{"key":"10.1016\/0004-3702(95)00126-3_BIB28","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","article-title":"Asymptotical properties of minimax trees and game searching procedures","volume":"14","author":"Pearl","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB29","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/358589.358616","article-title":"The solution for the branching factor of the alpha-beta pruning algorithm and its optimality","volume":"25","author":"Pearl","year":"1982","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(95)00126-3_BIB30","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00126-3_BIB31","series-title":"Algorithms. SIGAL '90","first-page":"211","article-title":"Another view on the SSS\u2217 algorithm","volume":"450","author":"Pijls","year":"1990"},{"key":"10.1016\/0004-3702(95)00126-3_BIB32_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56279-6_86","article-title":"Searching informed game trees","author":"Pijls","year":"1992"},{"key":"10.1016\/0004-3702(95)00126-3_BIB32_2","series-title":"Proceedings CSN 92","first-page":"246","article-title":"Extended abstract","author":"Pijls","year":"1992"},{"key":"10.1016\/0004-3702(95)00126-3_BIB32_3","series-title":"Algorithms and Computation, ISAAC 92","first-page":"332","volume":"650","year":"1992"},{"issue":"1","key":"10.1016\/0004-3702(95)00126-3_BIB33","first-page":"18","article-title":"SSS\u2217-like algorithms in constrained memory","volume":"16","author":"Pijls","year":"1993","journal-title":"ICCA J."},{"key":"10.1016\/0004-3702(95)00126-3_BIB34","article-title":"Solution trees as a unifying concept for game tree algorithms","author":"Pijls","year":"1995"},{"key":"10.1016\/0004-3702(95)00126-3_BIB35","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1996-19307","article-title":"Research re: search & Re-search","author":"Plaat","year":"1996"},{"key":"10.1016\/0004-3702(95)00126-3_BIB36","article-title":"Nearly optimal minimax tree search?","author":"Plaat","year":"1994"},{"key":"10.1016\/0004-3702(95)00126-3_BIB37","article-title":"A new paradigm for minimax search","author":"Plaat","year":"1994"},{"key":"10.1016\/0004-3702(95)00126-3_BIB38","series-title":"Proceedings IJCAI-95","first-page":"273","article-title":"Best-first fixed-depth game-tree search in practice","author":"Plaat","year":"1995"},{"key":"10.1016\/0004-3702(95)00126-3_BIB39","article-title":"A minimax algorithm better than Alpha-Beta? No and Yes","author":"Plaat","year":"1995"},{"issue":"4","key":"10.1016\/0004-3702(95)00126-3_BIB40","first-page":"4","article-title":"An improvement of the Scout tree-search algorithm","volume":"6","author":"Reinefeld","year":"1983","journal-title":"ICCA J."},{"key":"10.1016\/0004-3702(95)00126-3_BIB41","article-title":"Spielbaum Suchverfahren","volume":"200","author":"Reinefeld","year":"1989"},{"key":"10.1016\/0004-3702(95)00126-3_BIB42","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","article-title":"Enhanced iterative-deepening search","volume":"16","author":"Reinefeld","year":"1994","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB43","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0004-3702(94)90049-3","article-title":"Time-efficient state space search","volume":"71","author":"Reinefeld","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB44","series-title":"Proceedings IJCAI-85","first-page":"1040","article-title":"Information acquisition in minimal window search","author":"Reinefeld","year":"1985"},{"key":"10.1016\/0004-3702(95)00126-3_BIB45","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","article-title":"A minimax algorithm better than alpha-beta? Yes and no","volume":"21","author":"Roizen","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB46_1","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1986-9309","article-title":"Experiments in search and knowledge","author":"Schaeffer","year":"1986"},{"key":"10.1016\/0004-3702(95)00126-3_BIB46_2","unstructured":"Available as University of Alberta Tech. Rept. TR86-12."},{"key":"10.1016\/0004-3702(95)00126-3_BIB47","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","article-title":"The history heuristic and alpha-beta search enhancements in practice","volume":"11","author":"Schaeffer","year":"1989","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB48","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0004-3702(90)90071-7","article-title":"Conspiracy numbers","volume":"43","author":"Schaeffer","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB49","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(92)90074-8","article-title":"A world championship caliber checkers program","volume":"53","author":"Schaeffer","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00126-3_BIB50","series-title":"Chess Skill in Man and Machine","first-page":"82","article-title":"Chess 4.5\u2014The Northwestern University chess program","author":"Slate","year":"1977"},{"key":"10.1016\/0004-3702(95)00126-3_BIB51","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."},{"issue":"1","key":"10.1016\/0004-3702(95)00126-3_BIB52","first-page":"3","article-title":"The NegaC\u2217 search","volume":"15","author":"Weill","year":"1992","journal-title":"ICCA J."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:49:22Z","timestamp":1578444562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295001263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":55,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0004370295001263"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00126-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}