{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:29:21Z","timestamp":1773930561790,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0304-3975(00)00082-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:41:58Z","timestamp":1027593718000},"page":"197-215","source":"Crossref","is-referenced-by-count":17,"title":["Game tree algorithms and solution trees"],"prefix":"10.1016","volume":"252","author":[{"given":"Wim","family":"Pijls","sequence":"first","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\/S0304-3975(00)00082-7_BIB1","doi-asserted-by":"crossref","unstructured":"D. Bobrow, Artificial Intelligence in perspective, a retrospective on fifty volumes of the Artificial Intelligence Journal, Artificial Intelligence 59 (1993) 5\u201320, ISSN 0004-3702.","DOI":"10.1016\/0004-3702(93)90163-6"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB2","unstructured":"D. Breuker, Memory versus search in games, Ph.D. Thesis, University of Maastricht, 1998."},{"key":"10.1016\/S0304-3975(00)00082-7_BIB3","first-page":"255","article-title":"Trends in game tree search","volume":"vol. 1175","author":"de Bruin","year":"1996"},{"issue":"4","key":"10.1016\/S0304-3975(00)00082-7_BIB4","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\/S0304-3975(00)00082-7_BIB5","doi-asserted-by":"crossref","unstructured":"R.A. Finkel, J.P. Fishburn, Parallelism in alpha\u2013beta search, Artificial Intelligence 19 (1993) 89\u2013106, ISSN 0004-3702.","DOI":"10.1016\/0004-3702(82)90022-4"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","article-title":"Generalization of alpha\u2013beta and SSS* search procedures","volume":"29","author":"Ibaraki","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB7","unstructured":"T. Ibaraki, Search algorithms for minimax game trees, Conf. paper at Twenty Years NP-Completeness, Sicily, June 1991."},{"key":"10.1016\/S0304-3975(00)00082-7_BIB8","doi-asserted-by":"crossref","unstructured":"H. Iida, Heuristic theories on game-tree search, Ph.D. Thesis, Tokyo University of Agriculture and Technology, Tokyo, 1994.","DOI":"10.3233\/ICG-1994-17407"},{"issue":"4","key":"10.1016\/S0304-3975(00)00082-7_BIB9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha\u2013beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(83)80009-5","article-title":"A general branch and bound formulation for understanding and synthesizing and\/or tree search procedures","volume":"21","author":"Kumar","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS*","volume":"31","author":"Marsland","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB12","series-title":"Heuristics \u2013 Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB13","first-page":"211","article-title":"Another view on the SSS\u2217 algorithm","volume":"vol. 450","author":"Pijls","year":"1990"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB14","first-page":"539","article-title":"A theory of game trees, based on solution trees","volume":"vol. 1338","author":"Pijls","year":"1997"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB15","unstructured":"W. Pijls, A. de Bruin, Game tree algorithms and solution trees, Tech. Rep. EUR-CS-98-02, Erasmus University Rotterdam, 1998, available as: http:\/\/www.cs.few.eur.nl\/few\/inf\/publicaties\/rapporten.eur-few-cs-98-02.ps"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB16","unstructured":"A, Plaat, J, Schaeffer, W. Pijls, A. de Bruin, Best-first fixed depth game tree search in practice, Proc. 14th Internat. Joint Conf. on Artificial Intelligence (IJCAI-95), vol. 1, 1995, pp. 273\u2013279."},{"key":"10.1016\/S0304-3975(00)00082-7_BIB17","first-page":"299","article-title":"A minimax algorithm better than SSS*","volume":"84","author":"Plaat","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00082-7_BIB18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","article-title":"A minimax algorithm better than alpha\u2013beta?, Yes and no","volume":"21","author":"Roizen","year":"1983","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0304-3975(00)00082-7_BIB19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than alpha\u2013beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artificial Intelligence"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T09:55:16Z","timestamp":1578563716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000827"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00082-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}