{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T15:12:43Z","timestamp":1693667563423},"reference-count":48,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5715,"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":[[1997,12]]},"DOI":"10.1016\/s0004-3702(97)00059-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"195-242","source":"Crossref","is-referenced-by-count":24,"title":["A Bayesian approach to relevance in game playing"],"prefix":"10.1016","volume":"97","author":[{"given":"Eric B.","family":"Baum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren D.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00059-3_BIB1","article-title":"A statistical study of selective Min-Max search in computer chess","author":"Anantharaman","year":"1990"},{"issue":"2","key":"10.1016\/S0004-3702(97)00059-3_BIB2","first-page":"47","article-title":"Extension heuristics","volume":"14","author":"Anantharaman","year":"1991","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB3","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB4","series-title":"Proceedings AAAI-92","first-page":"507","article-title":"On optimal game tree propagation for imperfect players","author":"Baum","year":"1992"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB5","series-title":"Games: Planning and Learning, Papers from the 1993 Fall Symposium","first-page":"48","article-title":"How a Bayesian approaches games like chess","author":"Baum","year":"1993"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB6","unstructured":"E.B. Baum and W.D. Smith, Best play for imperfect players and game tree search, Tech. Rept., NEC, Princeton, NJ."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0004-3702(90)90072-8","article-title":"A generalized quiescence search algorithm","volume":"43","author":"Beal","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","article-title":"The B\u2217 search algorithm: a best first proof procedure","volume":"12","author":"Berliner","year":"1979","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(97)00059-3_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(95)00092-5","article-title":"B\u2217 probability-based search","volume":"86","author":"Berliner","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB10","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0004-3702(97)00059-3_BIB11","first-page":"71","article-title":"ProbCut: an effective selective extension of the \u03b1\u03b2 algorithm","volume":"18","author":"Buro","year":"1995","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB12","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\/S0004-3702(97)00059-3_BIB13","series-title":"How to play Warri","author":"Chamberlin","year":"1984"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB14","series-title":"Search in Artificial Intelligence","first-page":"451","article-title":"Comparison of the Minimax and product back-up rules in a variety of games","author":"Chi","year":"1989"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB15","first-page":"45","article-title":"Belle chess hardware","volume":"Vol. 3","author":"Condon","year":"1982"},{"issue":"3","key":"10.1016\/S0004-3702(97)00059-3_BIB16","first-page":"137","article-title":"Null move and deep search","volume":"16","author":"Donninger","year":"1993","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(97)00059-3_BIB17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","article-title":"Expected time bounds for selection","volume":"18","author":"Floyd","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB18","first-page":"89","article-title":"A five year plan for automatic chess","volume":"Vol. 2","author":"Good","year":"1968"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB19","series-title":"Proceedings 5th Workshop on Uncertainty in Artificial Intelligence","article-title":"Heuristic search as evidential reasoning","author":"Hansson","year":"1989"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB20","series-title":"Tech. Rept. CMU-CS-90-108","article-title":"Large scale parallelization of alpha-beta search: an algorithmic and architectural study withcomputer chess","author":"Hsu","year":"1990"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB21","unstructured":"A. Junghanns, J. Schaeffer et al., Diminishing returns for additional search in chess, in: Advances in Computer Chess, Vol. 8, to appear."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB22","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","article-title":"Monte-Carlo approximation algorithms for enumeration problems","volume":"10","author":"Karp","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB23","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0004-3702(95)00096-8","article-title":"Best-first minimax search","volume":"84","author":"Korf","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB24","first-page":"22980","article-title":"Othello, Brief and Basic","author":"Landau","year":"1984"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB25","unstructured":"H. La Poutre and W.D. Smith, Approximation of staircases by staircases, Work in progress, NECI, Princeton, NJ."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB26","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(88)90076-8","article-title":"A pattern classification approach to evaluation function learning","volume":"36","author":"Lee","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB28","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB29","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0004-3702(83)80011-3","article-title":"Pathology on game trees revisited and an alternative to minimaxing","volume":"21","author":"Nau","year":"1983","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/S0004-3702(97)00059-3_BIB30","first-page":"209","article-title":"A hypothesis concerning the strength of chess programs","volume":"8","author":"Newborn","year":"1985","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0004-3702(82)90034-0","article-title":"The B\u2217 search algorithm\u2014new results","volume":"19","author":"Palay","year":"1982","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB32","author":"Palay","year":"1985"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB33","author":"Pearl","year":"1984"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB34","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":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB35","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB36","author":"Russ","year":"1984"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB37","author":"Russell","year":"1991"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB38","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1986-9309","article-title":"Experiments in search and knowledge","author":"Schaeffer","year":"1986"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB39","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB40","first-page":"101","article-title":"Presence and absence of pathology on game trees","volume":"Vol. 4","author":"Schr\u00fcfer","year":"1986"},{"issue":"7","key":"10.1016\/S0004-3702(97)00059-3_BIB41","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. Mag."},{"issue":"2","key":"10.1016\/S0004-3702(97)00059-3_BIB42","first-page":"189","article-title":"Experiments with some programs that search game trees","volume":"16","author":"Slagle","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB43","series-title":"Chess Skill in Man and Machine","article-title":"Chess 4.5: the Northwestern University chess program","author":"Slate","year":"1983"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB44","unstructured":"W.D. Smith, Fixed point for negamaxing probability distributions on regular trees, NECI Tech. Rept., Princeton, NJ."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB45_1","unstructured":"W.D. Smith, C. Garrett, E. Baum and R. Tudor, Experiments with a Bayesian game player, Submitted for publication"},{"issue":"1","key":"10.1016\/S0004-3702(97)00059-3_BIB46","first-page":"14","article-title":"The technology curve revisited","volume":"11","author":"Szabo","year":"1988","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(97)00059-3_BIB47","author":"Tarjan","year":"1983"},{"key":"10.1016\/S0004-3702(97)00059-3_BIB48","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000593?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000593?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T12:00:43Z","timestamp":1580299243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0004370297000593"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00059-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}