{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:21:20Z","timestamp":1758892880368},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0004-3702(91)90042-i","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"183-190","source":"Crossref","is-referenced-by-count":2,"title":["A game tree with distinct leaf values which is easy for the alpha-beta algorithm"],"prefix":"10.1016","volume":"52","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Balkenhol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(91)90042-I_BIB1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/0196-6774(88)90016-8","article-title":"On the complexity of searching game trees and other recursion trees","volume":"9","author":"Alth\u00f6fer","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0004-3702(91)90042-I_BIB2","unstructured":"B. Balkenhol, Diplom Thesis, University of Bielefeld, Faculty of Mathematics (in preparation)."},{"key":"10.1016\/0004-3702(91)90042-I_BIB3","series-title":"On the parallel complexity of evaluating game trees","author":"Broder","year":"1990"},{"key":"10.1016\/0004-3702(91)90042-I_BIB4","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(91)90042-I_BIB5","series-title":"Proceedings First ACM Symposium on Parallel Algorithms and Architectures","first-page":"409","article-title":"On parallel evaluation of game trees","author":"Karp","year":"1989"},{"key":"10.1016\/0004-3702(91)90042-I_BIB6","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(91)90042-I_BIB7","series-title":"Encyclopedia of Artificial Intelligence","first-page":"159","article-title":"Computer chess methods","author":"Marsland","year":"1987"},{"key":"10.1016\/0004-3702(91)90042-I_BIB8","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(91)90042-I_BIB9","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(91)90042-I_BIB10","first-page":"101","article-title":"Presence and absence of pathology on game trees","volume":"4","author":"Schr\u00fcfer","year":"1986"},{"key":"10.1016\/0004-3702(91)90042-I_BIB11","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(91)90042-I_BIB12","article-title":"Parallel algorithms for combinatorial search problems","author":"Zhang","year":"1989"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029190042I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029190042I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T22:34:52Z","timestamp":1584484492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029190042I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["000437029190042I"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(91)90042-i","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}