{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:20:26Z","timestamp":1779366026913,"version":"3.53.0"},"reference-count":120,"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)00152-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:46:55Z","timestamp":1027615615000},"page":"277-311","source":"Crossref","is-referenced-by-count":167,"title":["Games solved: Now and in the future"],"prefix":"10.1016","volume":"134","author":[{"given":"H.Jaap","family":"van den Herik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos W.H.M.","family":"Uiterwijk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"van Rijswijck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00152-7_BIB001","series-title":"Heuristic Programming in Artificial Intelligence: The First Computer Olympiad","first-page":"134","article-title":"A note on the computer solution of Connect-Four","author":"Allen","year":"1989"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB002","series-title":"A knowledge-based approach of Connect Four: The game is over, white to move wins, M.Sc. Thesis","author":"Allis","year":"1988"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB003","series-title":"Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad","first-page":"73","article-title":"Databases in Awari","author":"Allis","year":"1991"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB004","series-title":"Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad","first-page":"232","article-title":"Which games will survive?","author":"Allis","year":"1991"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB005","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","article-title":"Proof-number search","volume":"66","author":"Allis","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB006","series-title":"Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad","first-page":"192","article-title":"Qubic solved again","author":"Allis","year":"1992"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB007","series-title":"Searching for solutions in games and artificial intelligence, Ph.D. Thesis","author":"Allis","year":"1994"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB008","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1111\/j.1467-8640.1996.tb00250.x","article-title":"Go-Moku solved by new search techniques","volume":"12","author":"Allis","year":"1995","journal-title":"Comput. Intelligence: An Internat. J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB009","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"189","article-title":"The game of Hex: An automatic theorem proving approach to game programming","author":"Anshelevich","year":"2000"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB010","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0004-3702(01)00154-0","article-title":"A hierarchical approach to computer Hex","volume":"134","author":"Anshelevich","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB011","series-title":"Board and Table Games from Many Civilisations","author":"Bell","year":"1979"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB012","series-title":"Winning Ways for your Mathematical Plays. Vol. 1: Games in General","author":"Berlekamp","year":"1982"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB013","series-title":"Winning Ways for your Mathematical Plays. Vol. 2: Games in Particular","author":"Berlekamp","year":"1982"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB014","series-title":"Games of No Chance","first-page":"365","article-title":"The economist's view of combinatorial games","volume":"29","author":"Berlekamp","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB015","series-title":"Advances in Computer Chess, Vol. 3","first-page":"93","article-title":"Machine-aided refinement of correct strategies for the endgame in chess","author":"Bramer","year":"1982"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB016","first-page":"28","article-title":"A database as a second","volume":"15","author":"Breuker","year":"1992","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB017","first-page":"152","article-title":"The AST Fourth Computer Olympiad","volume":"15","author":"Breuker","year":"1992","journal-title":"ICCA J."},{"issue":"4","key":"10.1016\/S0004-3702(01)00152-7_BIB018","first-page":"183","article-title":"Replacement schemes for transposition tables","volume":"17","author":"Breuker","year":"1994","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB019","first-page":"175","article-title":"Replacement schemes and two-level tables","volume":"19","author":"Breuker","year":"1996","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB020","series-title":"Memory versus search in games, Ph.D. Thesis","author":"Breuker","year":"1998"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB021","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0304-3975(99)00082-1","article-title":"Solving 8\u00d78 Domineering","volume":"230","author":"Breuker","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0004-3702(01)00152-7_BIB022","first-page":"207","article-title":"Solution trees as a basis for game-tree search","volume":"17","author":"de Bruin","year":"1994","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB023","first-page":"189","article-title":"The Othello match of the year: Takeshio Murakami vs. Logistello","volume":"20","author":"Buro","year":"1997","journal-title":"ICCA J."},{"issue":"6","key":"10.1016\/S0004-3702(01)00152-7_BIB024","first-page":"12","article-title":"How machines have learned to play Othello","volume":"14","author":"Buro","year":"1999","journal-title":"IEEE Intelligent Systems J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB025","series-title":"Computers and Games 2000","first-page":"263","article-title":"Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs","volume":"2063","author":"Buro","year":"2001"},{"issue":"4","key":"10.1016\/S0004-3702(01)00152-7_BIB026","first-page":"343","article-title":"Tchuka Ruma Solitaire","volume":"16","author":"Campbell","year":"1995","journal-title":"The UMAP Journal"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB027","series-title":"Computers and Games 2000","first-page":"40","article-title":"Abstract proof search","volume":"2063","author":"Cazenave","year":"2001"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB028","unstructured":"T. Cazenave, Personal communication, 2001"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB029","first-page":"181","article-title":"An upper bound for the number of reachable positions","volume":"19","author":"Chinchalkar","year":"1996","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB030","series-title":"Advances in Computer Chess, Vol. 1","first-page":"108","article-title":"A quantitative study of King and Pawn against King","author":"Clarke","year":"1977"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB031","series-title":"On Numbers and Games","author":"Conway","year":"1976"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB032","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(90)90074-A","article-title":"Perfect knowledge revisited","volume":"43","author":"Dekker","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB033","first-page":"79","article-title":"Human versus machine problem-solving: Winning openings in Dakon","volume":"3","author":"Donkers","year":"2000","journal-title":"Board Games Studies"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB034","unstructured":"H. Enderton, Personal communication, 1999"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB035","unstructured":"H. Enderton, Answers to infrequently asked questions about the game of Hex, Web page http:\/\/www.cs.cmu.edu\/People\/hde\/hex\/hexfaq"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB036","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial problem which is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB037","series-title":"Computers and Games 2000","first-page":"99","article-title":"Construction of Chinese Chess endgame databases by retrograde analysis","volume":"2063","author":"Fang","year":"2001"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB038","series-title":"Advances in Knowledge Discovery and Data Mining","author":"Fayyad","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB039","first-page":"6","article-title":"Amenor wins world 6\u00d76 championships!","author":"Feinstein","year":"1993","journal-title":"British Othello Federation Newsletter"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB040","unstructured":"B. Fraser, Personal communication, 2001"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB041","first-page":"147","article-title":"Machine learning in computer chess: The next generation","volume":"19","author":"F\u00fcrnkranz","year":"1996","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB042","first-page":"818","article-title":"The game of Hex and the Brouwer fixed point theorem","author":"Gale","year":"1986","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"10.1016\/S0004-3702(01)00152-7_BIB043","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1038\/scientificamerican0872-106","article-title":"Mathematical games","volume":"230","author":"Gardner","year":"1974","journal-title":"Scientific American"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB044","series-title":"Harnessing computational resources for efficient exhaustive search, Ph.D. Thesis","author":"Gasser","year":"1995"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB045","series-title":"Games of No Chance","first-page":"101","article-title":"Solving Nine Men's Morris","volume":"29","author":"Gasser","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB046","series-title":"Proc. AAAI-96, Portland, OR","first-page":"228","article-title":"Partition search","author":"Ginsberg","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB047","series-title":"Polyominoes","author":"Golomb","year":"1965"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB048","series-title":"Computers and Games 2000","first-page":"89","article-title":"Awari retrograde analysis","volume":"2063","author":"van der Goot","year":"2001"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB049","series-title":"Data Mining: Concepts and Techniques","author":"Han","year":"2001"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB050","unstructured":"T. Hashimoto, Y. Kajihara, N. Sasaki, H. Iida, J. Yoshimura, An evaluation function for Amazons, in: H.J. van den Herik, B. Monien (Eds.), Advances in Computer Games, Vol. 9, Universiteit Maastricht, Maastricht, pp. 191\u2013202"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB051","doi-asserted-by":"crossref","first-page":"9","DOI":"10.3233\/ICG-2000-23103","article-title":"Strategies for constrained optimisation","volume":"23","author":"Haworth","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB052","series-title":"A knowledge-based approach of the game of amazons, M.Sc. Thesis","author":"Hensgens","year":"2001"},{"issue":"2","key":"10.1016\/S0004-3702(01)00152-7_BIB053","first-page":"66","article-title":"The construction of an omniscient endgame data base","volume":"8","author":"van den Herik","year":"1985","journal-title":"ICCA J."},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB054","first-page":"29","article-title":"A data base on data bases","volume":"9","author":"van den Herik","year":"1986","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB055","series-title":"Proceedings of L'Intelligenza Artificiale Ed Il Gioco Degli Scacchi, IIIo Convegno Internazionale","first-page":"1","article-title":"Omniscience, the rulegiver?","author":"van den Herik","year":"1986"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB056","series-title":"Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad","year":"1992"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB057","series-title":"Computers and Games","volume":"1558","year":"1999"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB058","series-title":"Games in AI Research","year":"2000"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB059","doi-asserted-by":"crossref","first-page":"164","DOI":"10.3233\/ICG-2000-23306","article-title":"The Fifth Computer Olympiad","volume":"23","author":"van den Herik","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB060","series-title":"Advances in Computer Games, Vol. 9","year":"2001"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB061","first-page":"1","article-title":"Back to fifty","volume":"16","author":"Herschberg","year":"1993","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB062","doi-asserted-by":"crossref","first-page":"139","DOI":"10.3233\/ICG-2000-23303","article-title":"Solving Kalah","volume":"23","author":"Irving","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB063","series-title":"Using knowledge about the opponent in game-tree search, Ph.D. Thesis","author":"Jansen","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB064","first-page":"14","article-title":"Are there practical alternatives to alpha-beta?","volume":"21","author":"Junghanns","year":"1998","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB065","series-title":"Chess Studies, or Endings of Games","author":"Kling","year":"1851"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB066","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"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB067","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","article-title":"Linear-space best-first search","volume":"62","author":"Korf","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB068","series-title":"MSRI Workshop on Combinatorial Games, Berkeley, CA","article-title":"Who wins Domineering on rectangular boards?","author":"Lachmann","year":"2000"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB069","series-title":"Heuristic Programming in Artificial Intelligence: The First Computer Olympiad","year":"1989"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB070","series-title":"Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad","year":"1991"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB071","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/ICG-2000-23302","article-title":"Large endgame databases with limited memory space","volume":"23","author":"Lincke","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB072","unstructured":"T.T. Lincke, Personal communication, 2001"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB073","doi-asserted-by":"crossref","first-page":"173","DOI":"10.3233\/ICG-2000-23308","article-title":"Marvin wins Awari tournament","volume":"23","author":"Lincke","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB074","series-title":"Computers and Games 2000","volume":"2063","year":"2001"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB075","series-title":"Shogi (Japanese chess) as the AI research target next to chess","author":"Matsubara","year":"1993"},{"issue":"2","key":"10.1016\/S0004-3702(01)00152-7_BIB076","first-page":"103","article-title":"Natural developments in game research: From Chess to Shogi to Go","volume":"19","author":"Matsubara","year":"1996","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB077","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"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB078","first-page":"3","article-title":"Ideas on knowledge synthesis stemming from the KBBKN endgame","volume":"10","author":"Michie","year":"1987","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB079","series-title":"Computer go as a sum of local games: An application of combinatorial game theory, Ph.D. Thesis","author":"M\u00fcller","year":"1995"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB080","series-title":"Games in AI Research","first-page":"203","article-title":"Generalized thermography: A new approach to evaluation in computer Go","author":"M\u00fcller","year":"2000"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB081","unstructured":"M. M\u00fcller, Computer Amazons, Web page http:\/\/www.cs.ualberta.ca\/~mmueller\/amazons\/index.html"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB082","doi-asserted-by":"crossref","first-page":"148","DOI":"10.3233\/ICG-2000-23304","article-title":"Space-efficient indexing of chess endgame tables","volume":"23","author":"Nalimov","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB083","series-title":"Theory of Games and Economic Behavior","author":"von Neumann","year":"1944"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB084","series-title":"Advances in Computer Chess, Vol. 7","first-page":"19","article-title":"Extracting information from endgame databases","author":"Nunn","year":"1994"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB085","series-title":"Games of No Chance","first-page":"339","article-title":"Pentominoes: A first player win","volume":"29","author":"Orman","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB086","doi-asserted-by":"crossref","first-page":"202","DOI":"10.2307\/2689613","article-title":"Qubic: 4\u00d74\u00d74 Tic-Tac-Toe","volume":"53","author":"Patashnik","year":"1980","journal-title":"Mathematical Magazine"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00152-7_BIB087","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(95)00126-3","article-title":"A minimax algorithm better than SSS\u2217","volume":"87","author":"Plaat","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB088","series-title":"Expert Systems in the Micro-Electronic Age","first-page":"168","article-title":"Discovering rules by induction from large collections of examples","author":"Quinlan","year":"1979"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB089","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00288964","article-title":"Hex ist PSPACE-vollst\u00e4ndig","volume":"15","author":"Reisch","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB090","series-title":"Computer Hex: Are bees better than fruitflies?, M.Sc. Thesis","author":"van Rijswijck","year":"2000"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB091","unstructured":"J. van Rijswijck, Queenbee's home page, Web page http:\/\/www.cs.ualberta.ca\/~queenbee"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB092","series-title":"The Complete Mancala Games Book","author":"Russ","year":"2000"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB093","series-title":"Advances in Computer Chess, Vol. 5","first-page":"199","article-title":"Conspiracy numbers","author":"Schaeffer","year":"1989"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB094","series-title":"Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad","first-page":"119","article-title":"Reviving the game of checkers","author":"Schaeffer","year":"1991"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB095","series-title":"Games of No Chance","first-page":"119","article-title":"Solving the game of checkers","volume":"29","author":"Schaeffer","year":"1996"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB096","series-title":"One Jump Ahead: Challenging Human Supremacy in Checkers","author":"Schaeffer","year":"1997"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB097","series-title":"A solution of Go on 4\u00d74 board by game tree search program","author":"Sei","year":"2000"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00152-7_BIB098","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0004-3702(01)00084-4","article-title":"The PN\u2217-search algorithm: Application to Tsume-Shogi","volume":"129","author":"Seo","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB099","series-title":"Structured Induction in Expert Systems","author":"Shapiro","year":"1987"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB100","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0004-3702(01)00166-7","article-title":"World-championship-caliber Scrabble","volume":"134","author":"Sheppard","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB101","first-page":"33","article-title":"Almost all games are first person games","volume":"41","author":"Singmaster","year":"1981","journal-title":"Eureka"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB102","first-page":"270","article-title":"Almost all partizan games are first person and almost all impartizan games are maximal","volume":"7","author":"Singmaster","year":"1982","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB103","unstructured":"B. Spight, Personal communication, 2001"},{"issue":"2","key":"10.1016\/S0004-3702(01)00152-7_BIB104","first-page":"55","article-title":"Parallel analysis of certain endgames","volume":"12","author":"Stiller","year":"1989","journal-title":"ICCA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB105","series-title":"Exploiting symmetry on parallel architectures, Ph.D. Thesis","author":"Stiller","year":"1995"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB106","series-title":"Untersuchungen \u00fcber kombinatorische Spiele, M.Sc. Thesis","author":"Str\u00f6hlein","year":"1970"},{"issue":"2","key":"10.1016\/S0004-3702(01)00152-7_BIB107","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1162\/neco.1994.6.2.215","article-title":"TD-Gammon, a self-teaching Backgammon program, achieves master-level play","volume":"6","author":"Tesauro","year":"1994","journal-title":"Neural Comput."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB108","first-page":"217","article-title":"A prophecy fulfilled","volume":"74","author":"Thompson","year":"1983","journal-title":"EG"},{"issue":"3","key":"10.1016\/S0004-3702(01)00152-7_BIB109","first-page":"131","article-title":"Retrograde analysis of certain endgames","volume":"9","author":"Thompson","year":"1986","journal-title":"ICCA J."},{"issue":"4","key":"10.1016\/S0004-3702(01)00152-7_BIB110","first-page":"215","article-title":"6-piece endgames","volume":"19","author":"Thompson","year":"1996","journal-title":"ICCA J."},{"issue":"4","key":"10.1016\/S0004-3702(01)00152-7_BIB111","doi-asserted-by":"crossref","first-page":"203","DOI":"10.3233\/ICG-2000-23402","article-title":"Lambda-search in game trees\u2014With application to Go","volume":"23","author":"Thomsen","year":"2000","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB112","first-page":"1","article-title":"A computer-assisted study of Go on M\u00d7N boards","volume":"4","author":"Thorp","year":"1972","journal-title":"Information Sciences"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB113","series-title":"Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad","first-page":"108","article-title":"Design and implementation of a Chinese Chess program","author":"Tsao","year":"1991"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB114","series-title":"Heuristic Programming in Artificial Intelligence: The First Computer Olympiad","first-page":"113","article-title":"A knowledge-based approach to Connect-Four. The game is solved!","author":"Uiterwijk","year":"1989"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB115","series-title":"Proc. NAIC'91, Stichting Informatica Congressen, Amsterdam","first-page":"193","article-title":"Kennisbehandeling in positionele spelen: Computer-analyse van Four-in-a-Row","author":"Uiterwijk","year":"1991"},{"key":"10.1016\/S0004-3702(01)00152-7_BIB116","series-title":"Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad","first-page":"165","article-title":"Knowledge and strategies in Go-Moku","author":"Uiterwijk","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB117","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0020-0255(99)00095-X","article-title":"The advantage of the initiative","volume":"122","author":"Uiterwijk","year":"2000","journal-title":"Information Sciences"},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB118","doi-asserted-by":"crossref","first-page":"30","DOI":"10.3233\/ICG-2001-24104","article-title":"Solving Renju","volume":"24","author":"W\u00e1gner","year":"2001","journal-title":"ICGA J."},{"issue":"1","key":"10.1016\/S0004-3702(01)00152-7_BIB119","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/ICG-2001-24102","article-title":"The quad heuristic in Lines of Action","volume":"24","author":"Winands","year":"2001","journal-title":"ICGA J."},{"key":"10.1016\/S0004-3702(01)00152-7_BIB120","series-title":"Advances in Computer Games, Vol. 9","first-page":"261","article-title":"Computer analysis of some Chinese Chess endgames","author":"Wu","year":"2001"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T04:11:32Z","timestamp":1578802292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201001527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":120,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0004370201001527"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00152-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}