{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T09:06:34Z","timestamp":1692435994596},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4407,"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":[[2001,7]]},"DOI":"10.1016\/s0004-3702(01)00072-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:54:58Z","timestamp":1027634098000},"page":"1-26","source":"Crossref","is-referenced-by-count":6,"title":["The effect of mobility on minimaxing of game trees with random leaf values"],"prefix":"10.1016","volume":"130","author":[{"given":"Mark","family":"Levene","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trevor I.","family":"Fenner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00072-8_BIB001","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/S0895480192240470","article-title":"Correlation of boolean functions and pathology in recursion trees","volume":"8","author":"Alth\u00f6fer","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0004-3702(01)00072-8_BIB002","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0004-3702(97)00059-3","article-title":"A Bayesian approach to relevance in game playing","volume":"97","author":"Baum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB003","first-page":"3","article-title":"Random evaluation in Chess","volume":"17","author":"Beal","year":"1994","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00072-8_BIB004","series-title":"Search in Artificial Intelligence","first-page":"450","article-title":"Comparison of the minimax product back-up rules in a variety of games","author":"Chi","year":"1988"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB005","series-title":"Thought and Choice in Chess","author":"de Groot","year":"1978"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB006","series-title":"All the Right Moves","author":"Ebeling","year":"1987"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB007","series-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1968"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB008","series-title":"Combinatorial Games","first-page":"1","article-title":"What is a game?","volume":"43","author":"Guy","year":"1991"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB009","first-page":"78","article-title":"How to extract relevant knowledge from grandmaster games, Part 2: The notion of mobility, and the work of De Groot and Slater","volume":"10","author":"Hartmann","year":"1987","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00072-8_BIB010","series-title":"Advances in Computer Chess 6","first-page":"61","article-title":"Sundry computer chess topics","author":"Hartmann","year":"1991"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB011","series-title":"Computers, Chess and Cognition","first-page":"133","article-title":"Tree searching algorithms","author":"Kaindl","year":"1990"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB012","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/21.179839","article-title":"Reasons for the effects of bounded look-ahead search","volume":"22","author":"Kaindl","year":"1992","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0004-3702(01)00072-8_BIB013","series-title":"The Art of Computer Programming, Vol. I: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB014","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(01)00072-8_BIB015","first-page":"20","article-title":"A partial analysis of minimaxing game trees with random leaf nodes","volume":"18","author":"Levene","year":"1995","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00072-8_BIB016","series-title":"How Computers Play Chess","author":"Levy","year":"1991"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB017","series-title":"Recursive random games: A probabilistic model for perfect information games, Ph.D. Thesis","author":"Michon","year":"1983"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB018","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0004-3702(82)90010-8","article-title":"The Last Player Theorem","volume":"18","author":"Nau","year":"1982","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB019","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/2157.322400","article-title":"Decision quality as a function of search depth on game trees","volume":"30","author":"Nau","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB020","series-title":"Search with Probabilities","volume":"3","author":"Palay","year":"1985"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB021","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0004-3702(83)90004-8","article-title":"On the nature of pathology in game searching","volume":"20","author":"Pearl","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB022","series-title":"Proc. AAAI Fall Symposium, Games: Planning & Learning, Raleigh, NC","first-page":"51","article-title":"A re-examination of brute-force search","author":"Schaeffer","year":"1993"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB023","series-title":"Advances in Computer Chess 4","first-page":"101","article-title":"Presence and absence of pathology in game trees","author":"Schr\u00fcfer","year":"1986"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB024","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":"Philosophical Magazine"},{"key":"10.1016\/S0004-3702(01)00072-8_BIB025","series-title":"Proc. Symposium on Information Theory, London","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:S0004370201000728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:20:22Z","timestamp":1555298422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201000728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0004370201000728"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00072-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}