{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T02:30:07Z","timestamp":1782268207493,"version":"3.54.5"},"reference-count":30,"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,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4251,"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)00165-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:02:33Z","timestamp":1027598553000},"page":"1-7","source":"Crossref","is-referenced-by-count":51,"title":["Games, computers, and artificial intelligence"],"prefix":"10.1016","volume":"134","author":[{"given":"Jonathan","family":"Schaeffer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.Jaap","family":"van den Herik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00165-5_BIB001","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(01)00165-5_BIB002","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0004-3702(90)90072-8","article-title":"A generalised quiescence search algorithm","volume":"43","author":"Beal","year":"1990","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(01)00165-5_BIB003","first-page":"189","article-title":"The Othello match of the year: Takeshi Murakami vs. Logistello","volume":"20","author":"Buro","year":"1997","journal-title":"J. Internat. Computer Chess Assoc."},{"key":"10.1016\/S0004-3702(01)00165-5_BIB004","series-title":"Proc. IJCAI-99, Stockholm, Sweden, Vol. 1","first-page":"584","article-title":"GIB: Steps toward an expert-level bridge-playing program","author":"Ginsberg","year":"1999"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB005","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1613\/jair.820","article-title":"GIB: Imperfect information in a computationally challenging game","volume":"14","author":"Ginsberg","year":"2001","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00165-5_BIB006","series-title":"Advances in Computer Games, Vol. 9","first-page":"191","article-title":"An evaluation function for amazons","author":"Hashimoto","year":"2001"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB007","series-title":"Behind Deep Blue","author":"Hsu","year":"2002"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB008","series-title":"New developments in single-agent search, Ph.D. Thesis","author":"Junghanns","year":"1999"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00165-5_BIB009","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0004-3702(01)00109-6","article-title":"Enhancing single-agent search using domain knowledge","volume":"129","author":"Junghanns","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB010","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/320868.320877","article-title":"Experiments in chess","volume":"4","author":"Kister","year":"1957","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB011","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB012","series-title":"Proc. AAAI-97, Providence, RI","first-page":"700","article-title":"Finding optimal solutions to Rubik's Cube using pattern databases","author":"Korf","year":"1997"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB013","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"1171","article-title":"Human-level AI's killer application: Interactive computer games","author":"Laird","year":"2000"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB014","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(01)00165-5_BIB015","unstructured":"Octi, www.octi.net"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB016","unstructured":"University of Alberta GAMES Group, www.cs.ualberta.ca\/~games"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB017","unstructured":"RoboCup, www.robocup.com"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB018","doi-asserted-by":"crossref","first-page":"210","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 J. Res. Develop."},{"key":"10.1016\/S0004-3702(01)00165-5_BIB019","series-title":"Advances in Computers, Vol. 1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0065-2458(08)60608-7","article-title":"Programming computers to play games","author":"Samuel","year":"1960"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB020","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1147\/rd.116.0601","article-title":"Some studies in machine learning using the game of checkers: Recent progress","volume":"11","author":"Samuel","year":"1967","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0004-3702(01)00165-5_BIB021","series-title":"One Jump Ahead: Challenging Human Supremacy in Checkers","author":"Schaeffer","year":"1997"},{"issue":"2\u20133","key":"10.1016\/S0004-3702(01)00165-5_BIB022","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(92)90074-8","article-title":"A world championship caliber checkers program","volume":"53","author":"Schaeffer","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB023","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)00165-5_BIB024","unstructured":"B. Sheppard, Personal communication to J. Schaeffer"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB025","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/opre.6.1.1","article-title":"Heuristic problem solving: The next advance in operations research","volume":"6","author":"Simon","year":"1958","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(01)00165-5_BIB026","series-title":"Chess Skill in Man and Machine","first-page":"82","article-title":"Chess 4.5\u2014The Northwestern University chess program","author":"Slate","year":"1977"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB027","series-title":"Proc. Association for Computing Machinery Meeting, Toronto, ON","first-page":"46","article-title":"Logical or non-mathematical programmes","author":"Strachey","year":"1952"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB028","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00992697","article-title":"Practical issues in temporal difference learning","volume":"8","author":"Tesauro","year":"1992","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(01)00165-5_BIB029","series-title":"Advances in Computer Chess 3","first-page":"55","article-title":"Computer chess strength","author":"Thompson","year":"1982"},{"issue":"1","key":"10.1016\/S0004-3702(01)00165-5_BIB030","first-page":"3","article-title":"The quad heuristic in Lines of Action","volume":"24","author":"Winands","year":"2001","journal-title":"J. Internat. Computer Chess Assoc."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T11:31:17Z","timestamp":1620214277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201001655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0004370201001655"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00165-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}