{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:38:35Z","timestamp":1726083515921},"publisher-location":"Cham","reference-count":103,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030061661"},{"type":"electronic","value":"9783030061678"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-06167-8_11","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:02:20Z","timestamp":1588896140000},"page":"313-337","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Artificial Intelligence for Games"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Bouzy","sequence":"first","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Corruble","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"11_CR1","unstructured":"Allis L (1994) Searching for solutions in games and artificial intelligence. PhD thesis, Vrije Universitat Amsterdam"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Allis L, van der Meulen M, van den Herik H (1994) Proof-number search. Artif Intell 66:91\u2013124","DOI":"10.1016\/0004-3702(94)90004-3"},{"key":"11_CR3","unstructured":"Anantharaman T, Campbell M, Hsu F (1989) Singular extensions: adding selectivity to brute force searching. Artif Intell 43(1):99\u2013109"},{"key":"11_CR4","unstructured":"Andrade G, Ramalho G, Gomes AS, Corruble V (2006) Dynamic game balancing: an evaluation of user satisfaction. In: AAAI conference on artificial intelligence and interactive digital entertainment, pp 3\u20138"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Arneson B, Hayward RB, Henderson P (2010) Monte Carlo tree search in hex. IEEE Trans Comput Intell AI Games 2(4):251\u2013258","DOI":"10.1109\/TCIAIG.2010.2067212"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Beal D (1990) A generalised quiescence search algorithm. Artif Intell 43:85\u201398","DOI":"10.1016\/0004-3702(90)90072-8"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Berliner H (1979) The B* tree search algorithm: a best-first proof procedure. Artif Intell 12:23\u201340","DOI":"10.1016\/0004-3702(79)90003-1"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bouzy B (2005) Associating domain-dependent knowledge and Monte Carlo approaches within a Go program. Inf Sci 175(4):247\u2013257","DOI":"10.1016\/j.ins.2004.04.010"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Bouzy B, Cazenave T (2001) Computer Go: an AI oriented survey. Artif Intell 132(1):39\u2013103","DOI":"10.1016\/S0004-3702(01)00127-8"},{"key":"11_CR10","unstructured":"Bouzy B, Helmstetter B (2003) Monte-Carlo Go developments. In: ACG, vol 263 of IFIP. Kluwer, pp 159\u2013174"},{"key":"11_CR11","unstructured":"Bruegmann B (1993) Monte Carlo Go. Unpublished"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Bulitko V, Lustrek M, Schaeffer J, Bjornsson Y, Sigmundarson S (2008) Dynamic control in real-time heuristic search. J Artif Intell Res 32(1):419\u2013452","DOI":"10.1613\/jair.2497"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Campbell M, Marsland T (1983) A comparison of minimax tree search algorithms. Artif Intell 20:347\u2013367","DOI":"10.1016\/0004-3702(83)90001-2"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Campbell M, Hoane A, Hsu F-H (2002) Deep blue. Artif Intell 134:57\u201383","DOI":"10.1016\/S0004-3702(01)00129-1"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Cazenave T (2003) Metarules to improve tactical Go knowledge. Inf Sci 154(3\u20134):173\u2013188","DOI":"10.1016\/S0020-0255(03)00049-5"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Cazenave T (2006a) Optimizations of data structures, heuristics and algorithms for path-finding on maps. In: CIG, pp 27\u201333","DOI":"10.1109\/CIG.2006.311677"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Cazenave T (2006b) A phantom-Go program. Advances in computer games 2005. Lecture notes in computer science, vol. 4250. Springer, Berlin, pp 120\u2013125","DOI":"10.1007\/11922155_9"},{"key":"11_CR18","unstructured":"Cazenave T (2009) Nested Monte Carlo search. In: IJCAI 2009, Pasadena, USA, pp 456\u2013461"},{"key":"11_CR19","unstructured":"Cazenave T, Helmstetter B (2005) Combining tactical search and Monte-Carlo in the game of Go. IEEE CIG 2005:171\u2013175"},{"key":"11_CR20","unstructured":"Cazenave T, Jouandeau N (2007) On the parallelization of UCT. In: Proceedings of CGW07, pp 93\u2013101"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Cazenave T, Teytaud F (2012) Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Learning and intelligent optimization, pp 42\u201354","DOI":"10.1007\/978-3-642-34413-8_4"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Cazenave T, Saffidine A, Schofield MJ, Thielscher M (2016) Nested Monte Carlo search for two-player games. In: Proceedings of the thirtieth AAAI conference on artificial intelligence, Phoenix, Arizona, USA, 12\u201317 Feb 2016, pp 687\u2013693","DOI":"10.1609\/aaai.v30i1.10073"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Chang HS, Fu MC, Hu J, Marcus SI (2005) An adaptive sampling algorithm for solving Markov decision processes. Oper Res 53(1):126\u2013139","DOI":"10.1287\/opre.1040.0145"},{"key":"11_CR24","unstructured":"Chaslot G, Saito J, Bouzy B, Uiterwijk JWHM, van\u00a0den Herik HJ (2006) Monte-Carlo strategies for computer Go. In: Schobbens P-Y, Vanhoof W, Schwanen G (eds) Proceedings of the 18th BeNeLux conference on artificial intelligence, Namur, Belgium, pp 83\u201391"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Chaslot G, Winands M, Uiterwijk J, van den Herik H, Bouzy B (2008) Progressive strategies for Monte-Carlo tree search. New Math Nat Comput 4(3):343\u2013357","DOI":"10.1142\/S1793005708001094"},{"key":"11_CR26","unstructured":"Chou C-W, Teytaud O, Yen S-J (2011) Revisiting Monte Carlo tree search on a normal form game: Nogo. In: European conference on the applications of evolutionary computation. Springer, Berlin, pp 73\u201382"},{"key":"11_CR27","unstructured":"Corruble V, Ramalho G (2009) Jeux vid\u00e9o et Syst\u00e8mes Multi-Agents. IC2 Series. Herm\u00e8s Lavoisier, pp 235\u2013264. ISBN: 978-2-7462-1785-0"},{"key":"11_CR28","unstructured":"Couetoux A (2013) Monte Carlo tree search for continuous and stochastic sequential decision making problems. PhD thesis, Universit\u00e9 Paris Sud-Paris XI"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Coulom R (2006) Efficient selectivity and backup operators in Monte-Carlo tree search. In: Ciancarini P, van den Herik HJ (eds) Proceedings of the 5th international conference on computers and games, Turin, Italy","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Coulom R (2007) Computing Elo ratings of move patterns in the game of Go. ICGA J 4(30):198\u2013208","DOI":"10.3233\/ICG-2007-30403"},{"key":"11_CR31","unstructured":"Csikszentmihalyi M (1975) Beyond boredom and anxiety. Jossey-Bass San Francisco"},{"key":"11_CR32","unstructured":"Csikszentmihalyi M (1990) Flow: the psychology of optimal experience. Harper and Row, New York"},{"key":"11_CR33","unstructured":"Culberson JC, Schaeffer J (1998) Pattern databases. Comput Intell 4(14):318\u2013334"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"De Mesmay F, Rimmel A, Voronenko Y, P\u00fcschel M (2009) Bandit-based optimization on graphs with application to library performance tuning. In: ICML, Montr\u00e9al Canada","DOI":"10.1145\/1553374.1553468"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Degris T, Sigaud O, Wuillemin P (2009) Apprentissage par renforcement factoris\u00e9 pour le comportement de personnages non joueurs. Revue d\u2019Intelligence Artificielle 23(2):221\u2013251","DOI":"10.3166\/ria.23.221-251"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Donninger C (1993) Null move and deep search: selective search heuristics for obtuse chess programs. ICCA J 16(3):137\u2013143","DOI":"10.3233\/ICG-1993-16304"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Felner A, Korf RE, Hanan S (2004) Additive pattern database heuristics. J Artif Intell Res (JAIR) 22:279\u2013318","DOI":"10.1613\/jair.1480"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Felner A, Korf RE, Meshulam R, Holte RC (2007) Compressed pattern databases. J Artif Intell Res (JAIR) 30:213\u2013247","DOI":"10.1613\/jair.2241"},{"key":"11_CR39","unstructured":"Finley L (2016) Nested Monte Carlo tree search as applied to Samurai Sudoku"},{"key":"11_CR40","unstructured":"Finnsson H, Bj\u00f6rnsson Y (2008a) Simulation-based approach to general game playing. AAAI 8:259\u2013264"},{"key":"11_CR41","unstructured":"Finnsson H, Bj\u00f6rnsson Y (2008b) Simulation-based approach to general game playing. In: AAAI, pp 259\u2013264"},{"key":"11_CR42","unstructured":"Fl\u00f3rez-Puga G, G\u00f3mez-Mart\u0131n M, D\u0131az-Agudo B, Gonz\u00e1lez-Calero P (2008) Dynamic expansion of behaviour trees. In: AAAI conference on artificial intelligence and interactive digital entertainment, pp 36\u201341"},{"key":"11_CR43","unstructured":"Gelly S, Wang Y, Munos R, Teytaud O (2006) Modification of UCT with patterns in Monte Carlo Go. Rapport de recherche INRIA RR-6062"},{"key":"11_CR44","unstructured":"Gelly S, Hoock JB, Rimmel A, Teytaud O, Kalemkarian Y (2008) The parallelization of Monte-Carlo planning. In: Proceedings of the international conference on informatics in control, automation and robotics (ICINCO 2008), pp 198\u2013203. To appear"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Greenblatt R, Eastlake D, Crocker S (1967) The Greenblatt chess program. In: Fall joint computing conference, vol 31. ACM, New York, pp 801\u2013810","DOI":"10.1145\/1465611.1465715"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Harel D (1987) Statecharts: a visual formalism for complex systems","DOI":"10.1016\/0167-6423(87)90035-9"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernet 4(2):100\u2013107","DOI":"10.1109\/TSSC.1968.300136"},{"key":"11_CR48","unstructured":"Hoang H, Lee-Urban S, Mu\u00f1oz-Avila H (2005) Hierarchical plan representations for encoding strategic game AI. In: Proceedings of artificial intelligence and interactive digital entertainment conference (AIIDE-05)"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Ierusalimschy R, de\u00a0Figueiredo LH, Celes W (2007) The evolution of LUA. In: HOPL III: proceedings of the third ACM SIGPLAN conference on history of programming languages, ACM, New York, NY, USA, pp 2-1-2-26","DOI":"10.1145\/1238844.1238846"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Junghanns A (1998) Are there practical alternatives to alpha-beta? ICCA J 21(1):14\u201332","DOI":"10.3233\/ICG-1998-21103"},{"key":"11_CR51","doi-asserted-by":"crossref","unstructured":"Junghanns A, Schaeffer J (2001) Sokoban: enhancing general single-agent search methods using domain knowledge. Artif Intell 129(1\u20132):219\u2013251","DOI":"10.1016\/S0004-3702(01)00109-6"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Kendall G, Parkes A, Spoerer K (2008) A survey of NP-complete puzzles. ICGA J 31(1):13\u201334","DOI":"10.3233\/ICG-2008-31103"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Knuth D, Moore R (1975) An analysis of alpha-beta pruning. Artif Intell 6:293\u2013326","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Kocsis L, Szepesvari C (2006) Bandit-based Monte-Carlo planning. In: ECML\u201906, pp 282\u2013293","DOI":"10.1007\/11871842_29"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Korf R (1985a) Depth-first iterative deepening: an optimal admissible tree search. Artif Intell 27:97\u2013109","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Korf RE (1985b) Depth-first iterative-deepening: an optimal admissible tree search. Artif Intell 27(1):97\u2013109","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"11_CR57","unstructured":"Korf RE (1997) Finding optimal solutions to Rubik\u2019s cube using pattern databases. In: AAAI-97, pp 700\u2013705"},{"key":"11_CR58","doi-asserted-by":"crossref","unstructured":"Korf R, Chickering D (1994) Best-first search. Artif Intell 84:299\u2013337","DOI":"10.1016\/0004-3702(95)00096-8"},{"key":"11_CR59","unstructured":"Kozelek T (2009) Methods of MCTS and the game arimaa"},{"key":"11_CR60","doi-asserted-by":"crossref","unstructured":"Laird JE (2002) Research in human-level AI using computer games. Commun ACM 45(1):32\u201335","DOI":"10.1145\/502269.502290"},{"key":"11_CR61","unstructured":"Lee C-S, Wang M-H, Chaslot G, Hoock J-B, Rimmel A, Teytaud O, Tsai S-R, Hsu S-C, Hong T-P (2009) The computational intelligence of MOGO revealed in Taiwan\u2019s computer Go tournaments. In: IEEE transactions on computational intelligence and AI in games"},{"key":"11_CR62","doi-asserted-by":"crossref","unstructured":"Madeira C, Corruble V (2009) Strada: une approche adaptative pour les jeux de strat\u00e9gie modernes. Revue d\u2019Intelligence Artificielle 23(2):293\u2013326","DOI":"10.3166\/ria.23.293-326"},{"key":"11_CR63","unstructured":"Ma\u00eetrepierre R, Mary J, Munos R (2008) Adaptative play in texas hold\u2019em poker. In: European conference on artificial intelligence-ECAI"},{"key":"11_CR64","unstructured":"Marsland T (1986) A review of game-tree pruning. ICCA J 9(1):3\u201319"},{"key":"11_CR65","doi-asserted-by":"crossref","unstructured":"McAllester D (1988) Conspiracy numbers for min-max search. Artif Intell 35:287\u2013310","DOI":"10.1016\/0004-3702(88)90019-7"},{"key":"11_CR66","doi-asserted-by":"crossref","unstructured":"M\u00fcller M (2002) Computer Go. Artif Intell 134(1\u20132):145\u2013179","DOI":"10.1016\/S0004-3702(01)00121-7"},{"key":"11_CR67","unstructured":"Natkin S (2004) Jeux vid\u00e9o et m\u00e9dias du XXIe si\u00e8cle: quels mod\u00e8les pour les nouveaux loisirs num\u00e9riques? Vuibert"},{"key":"11_CR68","doi-asserted-by":"crossref","unstructured":"Nijssen P, Winands MH (2012) Monte Carlo tree search for the hide-and-seek game Scotland yard. IEEE Trans Comput Intell AI Games 4(4):282\u2013294","DOI":"10.1109\/TCIAIG.2012.2210424"},{"key":"11_CR69","doi-asserted-by":"crossref","unstructured":"Nijssen J, Winands MH (2013) Search policies in multi-player games 1. Icga J 36(1):3\u201321","DOI":"10.3233\/ICG-2013-36102"},{"key":"11_CR70","doi-asserted-by":"crossref","unstructured":"Ochs M, Sabouret N, Corruble V (2009) Simulation de la dynamique des emotions et des relations sociales de personnages virtuels. Revue d\u2019Intelligence Artificielle 23(2):327\u2013358","DOI":"10.3166\/ria.23.327-357"},{"key":"11_CR71","doi-asserted-by":"crossref","unstructured":"Paxton C, Raman V, Hager GD, Kobilarov M (2017) Combining neural networks and tree search for task and motion planning in challenging environments. arXiv:1703.07887","DOI":"10.1109\/IROS.2017.8206505"},{"key":"11_CR72","doi-asserted-by":"crossref","unstructured":"Pearl J (1980a) Asymptotic properties of minimax trees and game-searching procedures. Artif Intell 14:113\u2013138","DOI":"10.1016\/0004-3702(80)90037-5"},{"key":"11_CR73","unstructured":"Pearl J (1980b) SCOUT: a simple game-searching algorithm with proven optimal properties. In: Proceedings of the first annual national conference on artificial intelligence, pp 143\u2013145"},{"key":"11_CR74","doi-asserted-by":"crossref","unstructured":"Perlin K (2005) Toward interactive narrative. In: International conference on virtual storytelling. Springer, Berlin, pp 135\u2013147","DOI":"10.1007\/11590361_16"},{"key":"11_CR75","unstructured":"Pitrat J (1968) Realization of a general game-playing program. IFIP Congr 2:1570\u20131574"},{"key":"11_CR76","doi-asserted-by":"crossref","unstructured":"Plaat A, Schaeffer J, Pils W, de Bruin A (1996) Best-first fixed depth minimax algorithms. Artif Intell 87:255\u2013293","DOI":"10.1016\/0004-3702(95)00126-3"},{"key":"11_CR77","unstructured":"Rabin S (2002) AI game programming wisdom. Charles River Media, USA"},{"key":"11_CR78","doi-asserted-by":"crossref","unstructured":"Rickel J, Marsella S, Gratch J, Hill R, Traum D, Swartout W (2002) Toward a new generation of virtual humans for interactive experiences. In: IEEE intelligent systems, pp 32\u201338","DOI":"10.1109\/MIS.2002.1024750"},{"key":"11_CR79","unstructured":"Rivest R (1988) Game-tree searching by min-max approximation. Artif Intell 34(1):77\u201396"},{"key":"11_CR80","unstructured":"Rolet P, Sebag M, Teytaud O (2009a) Optimal active learning through billiards and upper confidence trees in continuous domains. In: Proceedings of the ECML conference"},{"key":"11_CR81","doi-asserted-by":"crossref","unstructured":"Rolet P, Sebag M, Teytaud O (2009b) Optimal robust expensive optimization is tractable. In: Gecco 2009, ACM, Montr\u00e9al Canada, p 8","DOI":"10.1145\/1569901.1570255"},{"key":"11_CR82","unstructured":"Romein JW, Bal HE (2003) Solving awari with parallel retrograde analysis. IEEE Comput 36(10):26\u201333"},{"key":"11_CR83","unstructured":"Rosin CD (2011) Nested rollout policy adaptation for Monte Carlo tree search. In: Ijcai, pp 649\u2013654"},{"key":"11_CR84","doi-asserted-by":"crossref","unstructured":"Schadd MP, Winands MH, Van Den\u00a0Herik HJ, Chaslot GM-B, Uiterwijk JW (2008) Single-player Monte Carlo tree search. In: International conference on computers and games. Springer, Berlin, pp 1\u201312","DOI":"10.1007\/978-3-540-87608-3_1"},{"key":"11_CR85","doi-asserted-by":"crossref","unstructured":"Schaeffer J (1989) The history heuristic and alpha-beta search enhancements in practice. IEEE Trans Pattern Anal Mach Intell 11(11):1203\u20131212","DOI":"10.1109\/34.42858"},{"key":"11_CR86","doi-asserted-by":"crossref","unstructured":"Schaeffer J (1990) Conspiracy numbers. Artif Intell 43:67\u201384","DOI":"10.1016\/0004-3702(90)90071-7"},{"key":"11_CR87","doi-asserted-by":"crossref","unstructured":"Schaeffer J, van den Herik J (2002) Games, computers, and artificial intelligence. Artif Intell 134:1\u20137","DOI":"10.1016\/S0004-3702(01)00165-5"},{"key":"11_CR88","doi-asserted-by":"crossref","unstructured":"Schaeffer J, Burch N, Bjornsson Y, Kishimoto A, Muller M, Lake R, Lu P, Sutphen S (2007) Checkers is solved. In: Science","DOI":"10.1126\/science.1144079"},{"key":"11_CR89","doi-asserted-by":"crossref","unstructured":"Shannon C (1950) Programming a computer to play Chess. Philos Mag 41:256\u2013275","DOI":"10.1080\/14786445008521796"},{"key":"11_CR90","unstructured":"Sheppard B (2002) World-championship-caliber scrabble scrabble\u00ae is a registered trademark. All intellectual property rights in and to the game are owned in the USA by Hasbro Inc. in Canada by Hasbro Canada Corporation, and throughout the rest of the world by JW Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Artif Intell 134(1-2):241\u2013275"},{"key":"11_CR91","doi-asserted-by":"crossref","unstructured":"Silver D, Huang A, Maddison CJ, Guez A, Sifre L, Van Den Driessche G, Schrittwieser J, Antonoglou I, Panneershelvam V, Lanctot M et al (2016) Mastering the game of Go with deep neural networks and tree search. Nature 529(7587):484\u2013489","DOI":"10.1038\/nature16961"},{"key":"11_CR92","unstructured":"Silver D, Hubert T, Schrittwieser J, Antonoglou I, Lai M, Guez A, Lanctot M, Sifre L, Kumaran D, Graepel T et al (2017a) Mastering chess and shogi by self-play with a general reinforcement learning algorithm. arXiv:1712.01815"},{"key":"11_CR93","doi-asserted-by":"crossref","unstructured":"Silver D, Schrittwieser J, Simonyan K, Antonoglou I, Huang A, Guez A, Hubert T, Baker L, Lai M, Bolton A et al (2017b) Mastering the game of go without human knowledge. Nature 550(7676):354","DOI":"10.1038\/nature24270"},{"key":"11_CR94","unstructured":"Slate D, Atkin L (1977) Chess 4.5 - the northwestern university chess program. In: Frey P (ed) Chess skill in man and machine. Springer, Berlin, pp 82\u2013118"},{"key":"11_CR95","doi-asserted-by":"crossref","unstructured":"Spronck P, Ponsen M, Sprinkhuizen-Kuyper I, Postma E (2006) Adaptive game AI with dynamic scripting. Mach Learn 63(3):217\u2013248","DOI":"10.1007\/s10994-006-6205-6"},{"key":"11_CR96","doi-asserted-by":"crossref","unstructured":"Stockman G (1979) A minimax algorithm better than alpha-beta? Artif Intell 12:179\u2013196","DOI":"10.1016\/0004-3702(79)90016-X"},{"key":"11_CR97","unstructured":"Sturtevant NR, Felner A, Barrer M, Schaeffer J, Burch N (2009) Memory-based heuristics for explicit state spaces. In: IJCAI, pp 609\u2013614"},{"key":"11_CR98","unstructured":"Teytaud F, Teytaud O (2009) Creating an upper-confidence-tree program for havannah. In: Advances in computer games. Springer, Berlin, pp 65\u201374"},{"key":"11_CR99","unstructured":"Thompson K (1996) 6-Piece endgames. ICCA J 19(4):215\u2013226"},{"key":"11_CR100","unstructured":"Tian Y, Jerry Ma*, Qucheng Gong*, Sengupta S, Chen Z, Zitnick CL (2018) Elf opengo. https:\/\/github.com\/pytorch\/ELF"},{"key":"11_CR101","unstructured":"von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton"},{"key":"11_CR102","doi-asserted-by":"crossref","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8(3\u20134):229\u2013256","DOI":"10.1007\/BF00992696"},{"key":"11_CR103","unstructured":"Zobrist A (1990) A new hashing method with application for game playing. ICCA J 13(2):69\u201373"}],"container-title":["A Guided Tour of Artificial Intelligence Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-06167-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T08:12:34Z","timestamp":1666512754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-06167-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030061661","9783030061678"],"references-count":103,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-06167-8_11","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}