{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:25:34Z","timestamp":1761647134753},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6171,"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,9]]},"DOI":"10.1016\/0004-3702(95)00092-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"97-156","source":"Crossref","is-referenced-by-count":9,"title":["B\u2217 probability based search"],"prefix":"10.1016","volume":"86","author":[{"given":"Hans J.","family":"Berliner","sequence":"first","affiliation":[]},{"given":"Chris","family":"McConnell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00092-5_BIB1","article-title":"A statistical study of selective min-max search in computer chess","author":"Anantharaman","year":"1990"},{"key":"10.1016\/0004-3702(95)00092-5_BIB2","series-title":"Proceedings AAAI Spring Symposium on Computer Game Playing","article-title":"Singular extensions: adding selectivity to brute force searching","author":"Anantharaman","year":"1988"},{"key":"10.1016\/0004-3702(95)00092-5_BIB3","series-title":"Proceedings IJCAI-73","first-page":"77","article-title":"Some necessary conditions for a Master chess program","author":"Berliner","year":"1973"},{"key":"10.1016\/0004-3702(95)00092-5_BIB4","article-title":"Chess as problem solving: the development of a tactics analyzer","author":"Berliner","year":"1974"},{"key":"10.1016\/0004-3702(95)00092-5_BIB5","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)00092-5_BIB6","article-title":"Some innovations introduced by Hitech","volume":"10","author":"Berliner","year":"1987","journal-title":"J. Int. Comput. Chess Assoc."},{"key":"10.1016\/0004-3702(95)00092-5_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0004-3702(86)90026-3","article-title":"The SUPREM architecture: a new intelligent paradigm","volume":"28","author":"Berliner","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00092-5_BIB8","article-title":"Measuring the performance potential of chess programs","volume":"5","author":"Berliner","year":"1989"},{"key":"10.1016\/0004-3702(95)00092-5_BIB9","series-title":"CMU Computer Science: A 25th Anniversary Commemorative","first-page":"311","article-title":"Producing behavior in a searching program","author":"Berliner","year":"1991"},{"issue":"2","key":"10.1016\/0004-3702(95)00092-5_BIB10","article-title":"Three positions","volume":"16","author":"Botvinnik","year":"1993","journal-title":"J. Int. Comput. Chess Assoc."},{"key":"10.1016\/0004-3702(95)00092-5_BIB11","series-title":"Proceedings ACM National Conference","first-page":"278","article-title":"The graph-history interaction: on ignoring position history","author":"Campbell","year":"1985"},{"key":"10.1016\/0004-3702(95)00092-5_BIB12","article-title":"Belle chess hardware","volume":"3","author":"Condon","year":"1982"},{"key":"10.1016\/0004-3702(95)00092-5_BIB13","author":"De Groot","year":"1965"},{"key":"10.1016\/0004-3702(95)00092-5_BIB14","author":"Ebeling","year":"1986"},{"key":"10.1016\/0004-3702(95)00092-5_BIB15","first-page":"203","article-title":"Game-tree search on a massively parallel system","volume":"7","author":"Feldmann","year":"1993"},{"key":"10.1016\/0004-3702(95)00092-5_BIB16","series-title":"Proceedings IJCAI-73","first-page":"23","article-title":"The bandwidth heuristic search","author":"Harris","year":"1973"},{"key":"10.1016\/0004-3702(95)00092-5_BIB17","author":"Hort","year":"1980"},{"key":"10.1016\/0004-3702(95)00092-5_BIB18","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)00092-5_BIB19","article-title":"Cray blitz","volume":"4","author":"Hyatt","year":"1986"},{"key":"10.1016\/0004-3702(95)00092-5_BIB20","series-title":"Proceedings ACM National Conference","article-title":"An adaptive tree pruning system: a language for programming realistic tree searches","author":"Kozdrowicki","year":"1968"},{"issue":"1","key":"10.1016\/0004-3702(95)00092-5_BIB21","article-title":"The Star Tech massively-parallel chess program","volume":"18","author":"Kuszmaul","year":"1995","journal-title":"J. Int. Comput. Chess Assoc."},{"key":"10.1016\/0004-3702(95)00092-5_BIB22","article-title":"Multiprocessor tree-search experiments","volume":"4","author":"Marsland","year":"1986"},{"key":"10.1016\/0004-3702(95)00092-5_BIB23","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)00092-5_BIB24","series-title":"Computers and Thought","article-title":"Chess playing programs and the problem of complexity","author":"Newell","year":"1963"},{"key":"10.1016\/0004-3702(95)00092-5_BIB25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0004-3702(82)90034-0","article-title":"The B\u2217 tree search algorithm\u2014new results","volume":"19","author":"Palay","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00092-5_BIB26","article-title":"Searching with Probabilities","author":"Palay","year":"1984"},{"key":"10.1016\/0004-3702(95)00092-5_BIB27","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00092-5_BIB28","author":"Reinfeld","year":"1958"},{"key":"10.1016\/0004-3702(95)00092-5_BIB29","series-title":"Proceedings AAAI Spring Symposium on Computer Game Playing","first-page":"3","article-title":"Multilevel decision-theoretic search","author":"Russell","year":"1988"},{"issue":"2","key":"10.1016\/0004-3702(95)00092-5_BIB30","doi-asserted-by":"crossref","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)00092-5_BIB31","series-title":"Chess Skill in Man and Machine","article-title":"CHESS 4.5 \u2014 the northwesterm Unversity chess program","author":"Slate","year":"1977"},{"key":"10.1016\/0004-3702(95)00092-5_BIB32","series-title":"Proceedings Symposium on Information Theory","first-page":"150","article-title":"Statistics for the chess computer and the factor of mobility","author":"Slater","year":"1950"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000925?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000925?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:19:04Z","timestamp":1580897944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0004370295000925"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00092-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}