{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T21:31:03Z","timestamp":1777671063278,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4223,"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":[[2002,1]]},"DOI":"10.1016\/s0004-3702(01)00093-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:06:09Z","timestamp":1027591569000},"page":"85-99","source":"Crossref","is-referenced-by-count":41,"title":["Improving heuristic mini-max search by supervised learning"],"prefix":"10.1016","volume":"134","author":[{"given":"Michael","family":"Buro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\/2","key":"10.1016\/S0004-3702(01)00093-5_BIB001","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)00093-5_BIB002","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(01)00093-5_BIB003","first-page":"9","article-title":"AI's greatest trends controversies","volume":"15 (January\/February)","author":"Berliner","year":"2000","journal-title":"IEEE Intelligent Systems Magazine"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB004","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1613\/jair.179","article-title":"Statistical feature combination for the evaluation of game positions","volume":"3","author":"Buro","year":"1995","journal-title":"JAIR"},{"issue":"2","key":"10.1016\/S0004-3702(01)00093-5_BIB005","first-page":"71","article-title":"ProbCut: An effective selective extension of the alpha-beta algorithm","volume":"18","author":"Buro","year":"1995","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00093-5_BIB006","first-page":"189","article-title":"The Othello match of the year Takeshi Murakami vs. Logistello","volume":"20","author":"Buro","year":"1997","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00093-5_BIB007","series-title":"Computers and Games, Proc. CG98","first-page":"126","article-title":"From simple features to sophisticated evaluation functions","volume":"1558","author":"Buro","year":"1999"},{"issue":"2","key":"10.1016\/S0004-3702(01)00093-5_BIB008","first-page":"98","article-title":"Toward opening book learning","volume":"22","author":"Buro","year":"1999","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00093-5_BIB009","series-title":"Games in AI Research, Proceedings of a Workshop on Game-Tree Search Held in 1997 at NECI in Princeton, NJ","first-page":"77","article-title":"Experiments with Multi-Probcut a new high-quality evaluation function for Othello","author":"Buro","year":"2000"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB010","series-title":"Genetic Programming III: Darwinian Invention and Problem Solving","author":"Koza","year":"1999"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB011","series-title":"Advances in Neural Information Processing Systems","first-page":"541","article-title":"Meiosis networks","author":"Hanson","year":"1990"},{"issue":"2","key":"10.1016\/S0004-3702(01)00093-5_BIB012","first-page":"75","article-title":"Extended futility pruning","volume":"21","author":"Heinz","year":"1998","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00093-5_BIB013","first-page":"123","article-title":"Adaptive null-move pruning","volume":"22","author":"Heinz","year":"1999","journal-title":"ICCA J."},{"issue":"1","key":"10.1016\/S0004-3702(01)00093-5_BIB014","first-page":"3","article-title":"Book learning\u2014A methodology to tune an opening book automatically","volume":"22","author":"Hyatt","year":"1999","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00093-5_BIB015","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)00093-5_BIB016","series-title":"Proc. 8th International Workshop on Machine Learning","first-page":"85","article-title":"Adaptive pattern-oriented chess","author":"Levinson","year":"1991"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB017","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","article-title":"Conspiracy numbers for minmax search","volume":"35","author":"McAllester","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB018","series-title":"Searching with Probabilities","author":"Palay","year":"1985"},{"issue":"1","key":"10.1016\/S0004-3702(01)00093-5_BIB019","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","article-title":"Game tree searching by minmax approximation","volume":"34","author":"Rivest","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB020","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"},{"issue":"3","key":"10.1016\/S0004-3702(01)00093-5_BIB021","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1147\/rd.33.0210","article-title":"Some studies in machine learning using the game of checkers","volume":"3","author":"Samuel","year":"1959","journal-title":"IBM Journal of Research Development"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB022","series-title":"Experiments in search knowledge, Ph.D. Thesis","author":"Schaeffer","year":"1986"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB023","series-title":"Computers, Chess, and Cognition","first-page":"197","article-title":"Learning in bebe","author":"Scherzer","year":"1990"},{"issue":"3","key":"10.1016\/S0004-3702(01)00093-5_BIB024","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/203330.203343","article-title":"Temporal difference learning TD\u2013Gammon","volume":"38","author":"Tesauro","year":"1995","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(01)00093-5_BIB025","series-title":"Constructive function approximation","author":"Utgoff","year":"1997"},{"issue":"1","key":"10.1016\/S0004-3702(01)00093-5_BIB026","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01411371","article-title":"Node splitting: A constructive algorithm for feed-forward neural networks","volume":"1","author":"Wynne-Jones","year":"1993","journal-title":"Neural Computing and Applications"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000935?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000935?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:27:08Z","timestamp":1578446828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201000935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0004370201000935"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00093-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}