GO for IT. Guillaume Chaslot. Mark Winands
|
|
- Meghan Peters
- 6 years ago
- Views:
Transcription
1 GO for IT Guillaume Chaslot Jaap van den Herik Mark Winands (UM) (UvT / Big Grid) (UM) Partnership for Advanced Computing in EUROPE Amsterdam, NH Hotel, Industrial Competitiveness: Europe goes HPC Krasnapolsky, September 3, 2008 PRACE meeting Dinner Talk 1
2 From Maastricht to Tilburg Tilburg University: TiCC TiCC stands for Tilburg Centre for Creative Computing The start was September 1, 2008 So, you are privileged to become familiar with TiCC already now 2
3 Technology and Future 1950 Mechanization Intelligent Programs Intelligent E-commerce Computerization Information handling Communication (ICT) E-commerce 2005 Agent Technology 2010 Ant Technology (Grid) 2030 Singularity Point 3
4 Go for IT Data Handling Information Technology Knowledge Engineering Agent Technology Grid Technology / Supercomputing 4
5 Go for Intelligence Games Gaming Serious Gaming 5
6 Go for Power PCs IBM 360 / / / 168 Supercomputers 1997: RS 6000 defeats Kasparov on Chess TERAS HUYGENS defeats Kim Myungwan on Go (9-stone handicap) 6
7 Four Challenging Questions 1. Can a computer play Go? 2. Can a computer defeat the human world champion? 3. Can a computer solve the game? 4. Are some generic ideas applicable elsewhere? 7
8 Computer Olympiad Initiative of David Levy (1989) Since 1989 there have been 12 olympiads; 4x Londen, 3x Maastricht, 1x Graz, 1x Ramat-Gan, 1x Taipei, 1x Turin, 1x Amsterdam Goal: Finding the best computer program for each game Connecting programmers / researchers of different games Computers play each other in competition Demonstrations: Man versus Machine Man + Machine versus Man + Machine 8
9 Computer versus Computer 9
10 Computer Olympiad In Amsterdam, June participants in several categories Competitions in Olympiad's history: Abalone, Awari, Amazons, Backgammon, Bao, Bridge, Checkers, Chess, Chinese Chess, Dots and Boxes, Draughts, Gipf, Go-Moku, 19x19 Go, 9x9 Go, Hex, Lines of Action, Poker, Renju, Roshambo, Scrabble, and Shogi In September 2008 in Beijing 10
11 Overview Solved Super human World champion Grand master Amateur Connect-four Amazons Go Qubic Gipf Draughts (10x10) Bridge Arimaa Go-Moku Othello Chinese Chess Shogi Renju Scrabble Hex Kalah Backgammon Poker Awari Lines of Action Nine men s morris Checkers (2006) Bao Chess (2006) 11
12 Go Computer Go programs are weak Problem: recognition of patterns Top Go programs:handtalk and MoGoTitan 12
13 13
14 Go for Go NWO: 2005 Maastricht / Tilburg Jaap van den Herik Jos Uiterwijk Mark Winands Jahn Saito Guillaume Chaslot (link to French) 14
15 - top contributors: MOGO University of Paris Sud: Jean-Yves Albert - Remi Munos - Guillaume Chaslot - Julien Perez - Christophe Fiter - Arpad Rimmel - Sylvain Gelly - Olivier Teytaud - Jean-Baptiste Hoock - Yizao Wang - Other contributors are: Vincent Danjean, Thomas Herault, Georges Bolsilca, David Silver - Most important institutes are (i) Tao, Inria, Cnrs, Universite Paris- Sud, Grid 5000, (ii) Institutes supporting G. Chaslot 15
16 Development of MoGo and MoGo Titan - Started in 2006 by Sylvain Gelly and Yizao Wang at University of Paris- Sud - August 2006: Takes the highest rank program on the 9x9 Computer Go Server. It still holds this rank for 2 years long. - June 2007: wins the 12th Computer Olympiads in Amsterdam, and first program ever to defeat a professional on 9x9 in a blitz game. - April 2008: wins the first non-blitz game against a professional. - May 2008: involvement of the project GoForGo leading to MoGo-Titan. - August 2008: wins the first match ever against a professional on 19x19 with 9 stones handicap (running on Huygens). This result is acknowledged as a milestone for AI. 16
17 MOGO is the French part MOGO TITAN IS THE NEW NAME and TITAN is the finding by Christian Huygens (a satellite moon around Saturnus) The name is taken as a tribute to Supercomputing in the Netherlands 17
18 The 9 stone Match - The professional commented: I think there s no chance on nine stones, it would even be difficult with eight stones. MoGo played really well; after getting a lead, every time I played aggressively, it just played safely, even when it meant sacrificing some stones. It didn t try to maximize the win and just played the most sure way to win. It s like a machine. 18
19 Financial partners: Partners of MoGo-Titan Partners providing computational time: 19
20 National Supercomputer in NL What When Flop/s Processors CDC Cyber M100 1 CDC Cyber M 200 M 2 Cray YMP G 1.3 G 4 Cray C G 4 G 4 Cray C G 12 G 12 SGI Origin T 1 T 1024 SGI Altix T 3.2 T 1440 IBM p T 15 T 1920 IBM p >60 T >60 T >3000 Software effort So the gain will be almost 1 M in 25 years 20
21 P6- architecture # of processors 3328 Water cooled Huygens at SARA MoGo had 800 processors at its disposal This was over 1000 times as powerful as the RS 6000 (1997) defeating Kasparov. 21
22 August 8, 2008 Portland - Oregon MoGo Titan plays Kom Myungwan A 9-stones handicap match The machine wins 22
23 IBM Supercomputer Huygens Used - MoGo using Huygens (provided by SARA) is called MoGo-Titan - The processors are IBM Power6 at 4.7Ghz. - Each node has 32 cores, and 256 GB of RAM. - It uses generally 10 to 25 nodes, out of 104 nodes. - Parallelization is using OpenMPI. 23
24 Human-Computer Matches in Go - For a long time, a prize of 40,000,000 NTD (1,400,000 $) for the first computer Go-playing program that would succeed in beating a Taipei Go Professional without handicap. The prize was donated by Ing Chang-Ki and was valid until 2000, due to the death of Ing Chang-Ki ,000 NTD (14,000 $) were offered to a program that would beat a professional at 9 stones. Numerous attempts were made but no program ever won. - More information on the numerous attemps are listed here: 24
25 Rank of the best programs: 9 dan Evolution of the level of programs 1 dan 9x9 19x19 20 kuy (Albert Zobrist) 25
26 The Difference between Chess and Go Chess: Search Tactics play an important role Go: Pattern Recognition Strategy is much more important 26
27 Two breakthroughs that enabled Go to play at acceptable level 1. Monte Carlo Search (Brügmann and Bouzy) 2. UCT algorithm (Chaslot, Coulom, Kocsis) UCT stands for Upper Confidence bounds applied to Trees 27
28 - Monte-Carlo Tree Search: underlying idea 28
29 - Exploration-exploitation dilemma: If only the best moves are explored (too few explorations), the algorithm is focusing on a few moves, and moves that - did not seem promising are forgotten. If too many moves are explored, the branching factor is too high and the search is not deep enough Alternative solutions have to be found (Progressive strategies, RAVE, etc ) 29
30 SUPERCOMPUTING, CONCLUSION MONTE CARLO TREE SEARCH and the UCT algorithm have sped up the performances in computer Go 30
31 FUTURE EXPECTATIONS MoGo-Titan defeats a top Go player in stones handicap stones handicap stones handicap stones handicap stones handicap stones handicap stones handicap stones handicap stones handicap MOGO-TITAN defeats the human Go World Champion The singularity point in Go is reached 31
32 MESSAGE Ray Kurzweil (2007): The singularity point is near The general point is due 2030 (Kurzweil) 2048 (others) 2400 (disbelievers) Nobody will deny the development. Everybody will think about the future. 32
A Bandit Approach for Tree Search
A An Example in Computer-Go Department of Statistics, University of Michigan March 27th, 2008 A 1 Bandit Problem K-Armed Bandit UCB Algorithms for K-Armed Bandit Problem 2 Classical Tree Search UCT Algorithm
More informationCreating a Havannah Playing Agent
Creating a Havannah Playing Agent B. Joosten August 27, 2009 Abstract This paper delves into the complexities of Havannah, which is a 2-person zero-sum perfectinformation board game. After determining
More informationGames solved: Now and in the future
Games solved: Now and in the future by H. J. van den Herik, J. W. H. M. Uiterwijk, and J. van Rijswijck Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Which game
More informationRecent Progress in Computer Go. Martin Müller University of Alberta Edmonton, Canada
Recent Progress in Computer Go Martin Müller University of Alberta Edmonton, Canada 40 Years of Computer Go 1960 s: initial ideas 1970 s: first serious program - Reitman & Wilcox 1980 s: first PC programs,
More informationComputer Go: from the Beginnings to AlphaGo. Martin Müller, University of Alberta
Computer Go: from the Beginnings to AlphaGo Martin Müller, University of Alberta 2017 Outline of the Talk Game of Go Short history - Computer Go from the beginnings to AlphaGo The science behind AlphaGo
More informationTwo-Player Perfect Information Games: A Brief Survey
Two-Player Perfect Information Games: A Brief Survey Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Domain: two-player games. Which game characters are predominant
More informationPlaying Othello Using Monte Carlo
June 22, 2007 Abstract This paper deals with the construction of an AI player to play the game Othello. A lot of techniques are already known to let AI players play the game Othello. Some of these techniques
More informationAdding expert knowledge and exploration in Monte-Carlo Tree Search
Adding expert knowledge and exploration in Monte-Carlo Tree Search Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud To cite this version: Guillaume Chaslot, Christophe
More informationTwo-Player Perfect Information Games: A Brief Survey
Two-Player Perfect Information Games: A Brief Survey Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Domain: two-player games. Which game characters are predominant
More informationExploration exploitation in Go: UCT for Monte-Carlo Go
Exploration exploitation in Go: UCT for Monte-Carlo Go Sylvain Gelly(*) and Yizao Wang(*,**) (*)TAO (INRIA), LRI, UMR (CNRS - Univ. Paris-Sud) University of Paris-Sud, Orsay, France sylvain.gelly@lri.fr
More informationScore Bounded Monte-Carlo Tree Search
Score Bounded Monte-Carlo Tree Search Tristan Cazenave and Abdallah Saffidine LAMSADE Université Paris-Dauphine Paris, France cazenave@lamsade.dauphine.fr Abdallah.Saffidine@gmail.com Abstract. Monte-Carlo
More informationGeneralized Rapid Action Value Estimation
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Generalized Rapid Action Value Estimation Tristan Cazenave LAMSADE - Universite Paris-Dauphine Paris,
More informationVirtual Global Search: Application to 9x9 Go
Virtual Global Search: Application to 9x9 Go Tristan Cazenave LIASD Dept. Informatique Université Paris 8, 93526, Saint-Denis, France cazenave@ai.univ-paris8.fr Abstract. Monte-Carlo simulations can be
More informationA Parallel Monte-Carlo Tree Search Algorithm
A Parallel Monte-Carlo Tree Search Algorithm Tristan Cazenave and Nicolas Jouandeau LIASD, Université Paris 8, 93526, Saint-Denis, France cazenave@ai.univ-paris8.fr n@ai.univ-paris8.fr Abstract. Monte-Carlo
More informationFoundations of AI. 6. Adversarial Search. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard & Bernhard Nebel
Foundations of AI 6. Adversarial Search Search Strategies for Games, Games with Chance, State of the Art Wolfram Burgard & Bernhard Nebel Contents Game Theory Board Games Minimax Search Alpha-Beta Search
More informationCombining Final Score with Winning Percentage by Sigmoid Function in Monte-Carlo Simulations
Combining Final Score with Winning Percentage by Sigmoid Function in Monte-Carlo Simulations Kazutomo SHIBAHARA Yoshiyuki KOTANI Abstract Monte-Carlo method recently has produced good results in Go. Monte-Carlo
More informationCS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence selman@cs.cornell.edu Module: Adversarial Search R&N: Chapter 5 Part II 1 Outline Game Playing Optimal decisions Minimax α-β pruning Case study: Deep Blue
More information情報処理学会研究報告 IPSJ SIG Technical Report Vol.2010-GI-24 No /6/25 UCT UCT UCT UCB A new UCT search method using position evaluation function an
UCT 1 2 1 UCT UCT UCB A new UCT search method using position evaluation function and its evaluation by Othello Shota Maehara, 1 Tsuyoshi Hashimoto 2 and Yasuyuki Kobayashi 1 The Monte Carlo tree search,
More informationFoundations of AI. 6. Board Games. Search Strategies for Games, Games with Chance, State of the Art
Foundations of AI 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller SA-1 Contents Board Games Minimax
More informationBy David Anderson SZTAKI (Budapest, Hungary) WPI D2009
By David Anderson SZTAKI (Budapest, Hungary) WPI D2009 1997, Deep Blue won against Kasparov Average workstation can defeat best Chess players Computer Chess no longer interesting Go is much harder for
More informationMonte-Carlo Tree Search Enhancements for Havannah
Monte-Carlo Tree Search Enhancements for Havannah Jan A. Stankiewicz, Mark H.M. Winands, and Jos W.H.M. Uiterwijk Department of Knowledge Engineering, Maastricht University j.stankiewicz@student.maastrichtuniversity.nl,
More informationComputing Elo Ratings of Move Patterns in the Game of Go
Computing Elo Ratings of Move Patterns in the Game of Go Rémi Coulom To cite this veion: Rémi Coulom Computing Elo Ratings of Move Patterns in the Game of Go van den Herik, H Jaap and Mark Winands and
More informationContents. Foundations of Artificial Intelligence. Problems. Why Board Games?
Contents Foundations of Artificial Intelligence 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Wolfram Burgard, Bernhard Nebel, and Martin Riedmiller Albert-Ludwigs-Universität
More informationMonte-Carlo Tree Search in Settlers of Catan
Monte-Carlo Tree Search in Settlers of Catan István Szita 1, Guillaume Chaslot 1, and Pieter Spronck 2 1 Maastricht University, Department of Knowledge Engineering 2 Tilburg University, Tilburg centre
More informationAdversarial Search. Soleymani. Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 5
Adversarial Search CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 5 Outline Game
More informationBuilding Opening Books for 9 9 Go Without Relying on Human Go Expertise
Journal of Computer Science 8 (10): 1594-1600, 2012 ISSN 1549-3636 2012 Science Publications Building Opening Books for 9 9 Go Without Relying on Human Go Expertise 1 Keh-Hsun Chen and 2 Peigang Zhang
More informationNOTE 6 6 LOA IS SOLVED
234 ICGA Journal December 2008 NOTE 6 6 LOA IS SOLVED Mark H.M. Winands 1 Maastricht, The Netherlands ABSTRACT Lines of Action (LOA) is a two-person zero-sum game with perfect information; it is a chess-like
More informationHow AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997)
How AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997) Alan Fern School of Electrical Engineering and Computer Science Oregon State University Deep Mind s vs. Lee Sedol (2016) Watson vs. Ken
More informationConstructing an Abalone Game-Playing Agent
18th June 2005 Abstract This paper will deal with the complexity of the game Abalone 1 and depending on this complexity, will explore techniques that are useful for constructing an Abalone game-playing
More informationFoundations of Artificial Intelligence Introduction State of the Art Summary. classification: Board Games: Overview
Foundations of Artificial Intelligence May 14, 2018 40. Board Games: Introduction and State of the Art Foundations of Artificial Intelligence 40. Board Games: Introduction and State of the Art 40.1 Introduction
More informationApplication of UCT Search to the Connection Games of Hex, Y, *Star, and Renkula!
Application of UCT Search to the Connection Games of Hex, Y, *Star, and Renkula! Tapani Raiko and Jaakko Peltonen Helsinki University of Technology, Adaptive Informatics Research Centre, P.O. Box 5400,
More informationON THE TACTICAL AND STRATEGIC BEHAVIOUR OF MCTS WHEN BIASING RANDOM SIMULATIONS
On the tactical and strategic behaviour of MCTS when biasing random simulations 67 ON THE TACTICAL AND STATEGIC BEHAVIOU OF MCTS WHEN BIASING ANDOM SIMULATIONS Fabien Teytaud 1 Julien Dehos 2 Université
More informationA Quoridor-playing Agent
A Quoridor-playing Agent P.J.C. Mertens June 21, 2006 Abstract This paper deals with the construction of a Quoridor-playing software agent. Because Quoridor is a rather new game, research about the game
More informationCSC321 Lecture 23: Go
CSC321 Lecture 23: Go Roger Grosse Roger Grosse CSC321 Lecture 23: Go 1 / 21 Final Exam Friday, April 20, 9am-noon Last names A Y: Clara Benson Building (BN) 2N Last names Z: Clara Benson Building (BN)
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität
More information46.1 Introduction. Foundations of Artificial Intelligence Introduction MCTS in AlphaGo Neural Networks. 46.
Foundations of Artificial Intelligence May 30, 2016 46. AlphaGo and Outlook Foundations of Artificial Intelligence 46. AlphaGo and Outlook Thomas Keller Universität Basel May 30, 2016 46.1 Introduction
More informationArtificial Intelligence. Minimax and alpha-beta pruning
Artificial Intelligence Minimax and alpha-beta pruning In which we examine the problems that arise when we try to plan ahead to get the best result in a world that includes a hostile agent (other agent
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität
More informationAdversarial Search: Game Playing. Reading: Chapter
Adversarial Search: Game Playing Reading: Chapter 6.5-6.8 1 Games and AI Easy to represent, abstract, precise rules One of the first tasks undertaken by AI (since 1950) Better than humans in Othello and
More informationAdversarial Search. Chapter 5. Mausam (Based on slides of Stuart Russell, Andrew Parks, Henry Kautz, Linda Shapiro, Diane Cook) 1
Adversarial Search Chapter 5 Mausam (Based on slides of Stuart Russell, Andrew Parks, Henry Kautz, Linda Shapiro, Diane Cook) 1 Game Playing Why do AI researchers study game playing? 1. It s a good reasoning
More informationMonte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions
Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions Hendrik Baier and Mark H.M. Winands Games and AI Group, Department of Knowledge Engineering Faculty of Humanities and Sciences,
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Adversarial Search Instructor: Stuart Russell University of California, Berkeley Game Playing State-of-the-Art Checkers: 1950: First computer player. 1959: Samuel s self-taught
More informationInvestigations with Monte Carlo Tree Search for finding better multivariate Horner schemes
Investigations with Monte Carlo Tree Search for finding better multivariate Horner schemes H. Jaap van den Herik, Jan Kuipers, 2 Jos A.M. Vermaseren 2, and Aske Plaat Tilburg University, Tilburg center
More informationThe Computational Intelligence of MoGo Revealed in Taiwan s Computer Go Tournaments
The Computational Intelligence of MoGo Revealed in Taiwan s Computer Go Tournaments Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai,
More informationEarly Playout Termination in MCTS
Early Playout Termination in MCTS Richard Lorentz (B) Department of Computer Science, California State University, Northridge, CA 91330-8281, USA lorentz@csun.edu Abstract. Many researchers view mini-max
More informationMonte Carlo Tree Search
Monte Carlo Tree Search 1 By the end, you will know Why we use Monte Carlo Search Trees The pros and cons of MCTS How it is applied to Super Mario Brothers and Alpha Go 2 Outline I. Pre-MCTS Algorithms
More informationRevisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo
Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo C.-W. Chou, Olivier Teytaud, Shi-Jim Yen To cite this version: C.-W. Chou, Olivier Teytaud, Shi-Jim Yen. Revisiting Monte-Carlo Tree Search
More informationMONTE-CARLO TWIXT. Janik Steinhauer. Master Thesis 10-08
MONTE-CARLO TWIXT Janik Steinhauer Master Thesis 10-08 Thesis submitted in partial fulfilment of the requirements for the degree of Master of Science of Artificial Intelligence at the Faculty of Humanities
More informationOutline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game
Outline Game Playing ECE457 Applied Artificial Intelligence Fall 2007 Lecture #5 Types of games Playing a perfect game Minimax search Alpha-beta pruning Playing an imperfect game Real-time Imperfect information
More informationPlayout Search for Monte-Carlo Tree Search in Multi-Player Games
Playout Search for Monte-Carlo Tree Search in Multi-Player Games J. (Pim) A.M. Nijssen and Mark H.M. Winands Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities and Sciences,
More informationFoundations of AI. 5. Board Games. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard and Luc De Raedt SA-1
Foundations of AI 5. Board Games Search Strategies for Games, Games with Chance, State of the Art Wolfram Burgard and Luc De Raedt SA-1 Contents Board Games Minimax Search Alpha-Beta Search Games with
More informationGames and Adversarial Search
1 Games and Adversarial Search BBM 405 Fundamentals of Artificial Intelligence Pinar Duygulu Hacettepe University Slides are mostly adapted from AIMA, MIT Open Courseware and Svetlana Lazebnik (UIUC) Spring
More informationLast update: March 9, Game playing. CMSC 421, Chapter 6. CMSC 421, Chapter 6 1
Last update: March 9, 2010 Game playing CMSC 421, Chapter 6 CMSC 421, Chapter 6 1 Finite perfect-information zero-sum games Finite: finitely many agents, actions, states Perfect information: every agent
More informationOne Jump Ahead. Jonathan Schaeffer Department of Computing Science University of Alberta
One Jump Ahead Jonathan Schaeffer Department of Computing Science University of Alberta jonathan@cs.ualberta.ca Research Inspiration Perspiration 1989-2007? Games and AI Research Building high-performance
More informationUsing Neural Network and Monte-Carlo Tree Search to Play the Game TEN
Using Neural Network and Monte-Carlo Tree Search to Play the Game TEN Weijie Chen Fall 2017 Weijie Chen Page 1 of 7 1. INTRODUCTION Game TEN The traditional game Tic-Tac-Toe enjoys people s favor. Moreover,
More informationA Study of UCT and its Enhancements in an Artificial Game
A Study of UCT and its Enhancements in an Artificial Game David Tom and Martin Müller Department of Computing Science, University of Alberta, Edmonton, Canada, T6G 2E8 {dtom, mmueller}@cs.ualberta.ca Abstract.
More informationAIs may use randomness to finally master this ancient game of strategy
07.GoPlayingAIs.NA.indd 48 6/13/14 1:30 PM ggo-bot, AIs may use randomness to finally master this ancient game of strategy By Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto Photography by Dan Saelinger
More informationOn Games And Fairness
On Games And Fairness Hiroyuki Iida Japan Advanced Institute of Science and Technology Ishikawa, Japan iida@jaist.ac.jp Abstract. In this paper we conjecture that the game-theoretic value of a sophisticated
More informationMonte-Carlo Tree Search for the Simultaneous Move Game Tron
Monte-Carlo Tree Search for the Simultaneous Move Game Tron N.G.P. Den Teuling June 27, 2011 Abstract Monte-Carlo Tree Search (MCTS) has been successfully applied to many games, particularly in Go. In
More informationTree Parallelization of Ary on a Cluster
Tree Parallelization of Ary on a Cluster Jean Méhat LIASD, Université Paris 8, Saint-Denis France, jm@ai.univ-paris8.fr Tristan Cazenave LAMSADE, Université Paris-Dauphine, Paris France, cazenave@lamsade.dauphine.fr
More informationUnit-III Chap-II Adversarial Search. Created by: Ashish Shah 1
Unit-III Chap-II Adversarial Search Created by: Ashish Shah 1 Alpha beta Pruning In case of standard ALPHA BETA PRUNING minimax tree, it returns the same move as minimax would, but prunes away branches
More informationOn the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms
On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms Fabien Teytaud, Olivier Teytaud To cite this version: Fabien Teytaud, Olivier Teytaud. On the Huge Benefit of Decisive Moves
More informationOld-fashioned Computer Go vs Monte-Carlo Go
Old-fashioned Computer Go vs Monte-Carlo Go Bruno Bouzy Paris Descartes University, France CIG07 Tutorial April 1 st 2007 Honolulu, Hawaii 1 Outline Computer Go (CG) overview Rules of the game History
More informationAlphaGo and Artificial Intelligence GUEST LECTURE IN THE GAME OF GO AND SOCIETY
AlphaGo and Artificial Intelligence HUCK BENNET T (NORTHWESTERN UNIVERSITY) GUEST LECTURE IN THE GAME OF GO AND SOCIETY AT OCCIDENTAL COLLEGE, 10/29/2018 The Game of Go A game for aliens, presidents, and
More informationA Desktop Grid Computing Service for Connect6
A Desktop Grid Computing Service for Connect6 I-Chen Wu*, Chingping Chen*, Ping-Hung Lin*, Kuo-Chan Huang**, Lung- Ping Chen***, Der-Johng Sun* and Hsin-Yun Tsou* *Department of Computer Science, National
More informationPruning playouts in Monte-Carlo Tree Search for the game of Havannah
Pruning playouts in Monte-Carlo Tree Search for the game of Havannah Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos To cite this version: Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud,
More informationThe Evolution of Knowledge and Search in Game-Playing Systems
The Evolution of Knowledge and Search in Game-Playing Systems Jonathan Schaeffer Abstract. The field of artificial intelligence (AI) is all about creating systems that exhibit intelligent behavior. Computer
More informationThe larger the ratio, the better. If the ratio approaches 0, then we re in trouble. The idea is to choose moves that maximize this ratio.
CS05 Game Playing The search routines we have covered so far are excellent methods to use for single player games (such as the 8 puzzle). We must modify our methods for two or more player games. Ideally:
More informationAdversarial Search. Chapter 5. Mausam (Based on slides of Stuart Russell, Andrew Parks, Henry Kautz, Linda Shapiro) 1
Adversarial Search Chapter 5 Mausam (Based on slides of Stuart Russell, Andrew Parks, Henry Kautz, Linda Shapiro) 1 Game Playing Why do AI researchers study game playing? 1. It s a good reasoning problem,
More informationMonte-Carlo Tree Search and Minimax Hybrids
Monte-Carlo Tree Search and Minimax Hybrids Hendrik Baier and Mark H.M. Winands Games and AI Group, Department of Knowledge Engineering Faculty of Humanities and Sciences, Maastricht University Maastricht,
More informationUCD : Upper Confidence bound for rooted Directed acyclic graphs
UCD : Upper Confidence bound for rooted Directed acyclic graphs Abdallah Saffidine a, Tristan Cazenave a, Jean Méhat b a LAMSADE Université Paris-Dauphine Paris, France b LIASD Université Paris 8 Saint-Denis
More informationGame playing. Chapter 5, Sections 1 6
Game playing Chapter 5, Sections 1 6 Artificial Intelligence, spring 2013, Peter Ljunglöf; based on AIMA Slides c Stuart Russel and Peter Norvig, 2004 Chapter 5, Sections 1 6 1 Outline Games Perfect play
More informationProgramming Project 1: Pacman (Due )
Programming Project 1: Pacman (Due 8.2.18) Registration to the exams 521495A: Artificial Intelligence Adversarial Search (Min-Max) Lectured by Abdenour Hadid Adjunct Professor, CMVS, University of Oulu
More informationAdversarial Search (I)
Adversarial Search (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010
More informationAdversarial Search (I)
Adversarial Search (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010
More informationCurrent Frontiers in Computer Go
Current Frontiers in Computer Go Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai To cite this version: Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim
More informationGame Playing. Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Game Playing Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM. Game Playing In most tree search scenarios, we have assumed the situation is not going to change whilst
More informationAI in Tabletop Games. Team 13 Josh Charnetsky Zachary Koch CSE Professor Anita Wasilewska
AI in Tabletop Games Team 13 Josh Charnetsky Zachary Koch CSE 352 - Professor Anita Wasilewska Works Cited Kurenkov, Andrey. a-brief-history-of-game-ai.png. 18 Apr. 2016, www.andreykurenkov.com/writing/a-brief-history-of-game-ai/
More informationAndrei Behel AC-43И 1
Andrei Behel AC-43И 1 History The game of Go originated in China more than 2,500 years ago. The rules of the game are simple: Players take turns to place black or white stones on a board, trying to capture
More informationEnhancements for Monte-Carlo Tree Search in Ms Pac-Man
Enhancements for Monte-Carlo Tree Search in Ms Pac-Man Tom Pepels June 19, 2012 Abstract In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man.
More informationGame-Playing & Adversarial Search
Game-Playing & Adversarial Search This lecture topic: Game-Playing & Adversarial Search (two lectures) Chapter 5.1-5.5 Next lecture topic: Constraint Satisfaction Problems (two lectures) Chapter 6.1-6.4,
More informationUNIT 13A AI: Games & Search Strategies. Announcements
UNIT 13A AI: Games & Search Strategies 1 Announcements Do not forget to nominate your favorite CA bu emailing gkesden@gmail.com, No lecture on Friday, no recitation on Thursday No office hours Wednesday,
More informationGame-playing: DeepBlue and AlphaGo
Game-playing: DeepBlue and AlphaGo Brief history of gameplaying frontiers 1990s: Othello world champions refuse to play computers 1994: Chinook defeats Checkers world champion 1997: DeepBlue defeats world
More informationMonte Carlo Tree Search in a Modern Board Game Framework
Monte Carlo Tree Search in a Modern Board Game Framework G.J.B. Roelofs Januari 25, 2012 Abstract This article describes the abstraction required for a framework capable of playing multiple complex modern
More informationQuick work: Memory allocation
Quick work: Memory allocation The OS is using a fixed partition algorithm. Processes place requests to the OS in the following sequence: P1=15 KB, P2=5 KB, P3=30 KB Draw the memory map at the end, if each
More informationUNIT 13A AI: Games & Search Strategies
UNIT 13A AI: Games & Search Strategies 1 Artificial Intelligence Branch of computer science that studies the use of computers to perform computational processes normally associated with human intellect
More informationSet 4: Game-Playing. ICS 271 Fall 2017 Kalev Kask
Set 4: Game-Playing ICS 271 Fall 2017 Kalev Kask Overview Computer programs that play 2-player games game-playing as search with the complication of an opponent General principles of game-playing and search
More informationUpper Confidence Trees with Short Term Partial Information
Author manuscript, published in "EvoGames 2011 6624 (2011) 153-162" DOI : 10.1007/978-3-642-20525-5 Upper Confidence Trees with Short Term Partial Information Olivier Teytaud 1 and Sébastien Flory 2 1
More informationAdversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I
Adversarial Search and Game- Playing C H A P T E R 6 C M P T 3 1 0 : S P R I N G 2 0 1 1 H A S S A N K H O S R A V I Adversarial Search Examine the problems that arise when we try to plan ahead in a world
More informationLecture 33: How can computation Win games against you? Chess: Mechanical Turk
4/2/0 CS 202 Introduction to Computation " UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department Lecture 33: How can computation Win games against you? Professor Andrea Arpaci-Dusseau Spring 200
More informationAIR FORCE INSTITUTE OF TECHNOLOGY
COMPLEXITY, HEURISTIC, AND SEARCH ANALYSIS FOR THE GAMES OF CROSSINGS AND EPAMINONDAS THESIS David W. King Jr, Captain, USAF AFIT-ENG-14-M-44 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE
More informationCS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH Santiago Ontañón so367@drexel.edu Recall: Adversarial Search Idea: When there is only one agent in the world, we can solve problems using DFS, BFS, ID,
More informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic So far we assumed a single-agent environment, but what if there are more agents and
More informationStrategic Evaluation in Complex Domains
Strategic Evaluation in Complex Domains Tristan Cazenave LIP6 Université Pierre et Marie Curie 4, Place Jussieu, 755 Paris, France Tristan.Cazenave@lip6.fr Abstract In some complex domains, like the game
More informationCS 331: Artificial Intelligence Adversarial Search II. Outline
CS 331: Artificial Intelligence Adversarial Search II 1 Outline 1. Evaluation Functions 2. State-of-the-art game playing programs 3. 2 player zero-sum finite stochastic games of perfect information 2 1
More informationCh.4 AI and Games. Hantao Zhang. The University of Iowa Department of Computer Science. hzhang/c145
Ch.4 AI and Games Hantao Zhang http://www.cs.uiowa.edu/ hzhang/c145 The University of Iowa Department of Computer Science Artificial Intelligence p.1/29 Chess: Computer vs. Human Deep Blue is a chess-playing
More informationMonte Carlo Tree Search. Simon M. Lucas
Monte Carlo Tree Search Simon M. Lucas Outline MCTS: The Excitement! A tutorial: how it works Important heuristics: RAVE / AMAF Applications to video games and real-time control The Excitement Game playing
More informationProbability of Potential Model Pruning in Monte-Carlo Go
Available online at www.sciencedirect.com Procedia Computer Science 6 (211) 237 242 Complex Adaptive Systems, Volume 1 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri University of Science
More informationComputer Analysis of Connect-4 PopOut
Computer Analysis of Connect-4 PopOut University of Oulu Department of Information Processing Science Master s Thesis Jukka Pekkala May 18th 2014 2 Abstract In 1988, Connect-4 became the second non-trivial
More informationCS 188: Artificial Intelligence Spring Game Playing in Practice
CS 188: Artificial Intelligence Spring 2006 Lecture 23: Games 4/18/2006 Dan Klein UC Berkeley Game Playing in Practice Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in 1994.
More information