Sum of Combinatorial Games by Leaf Wednesday, October 12th, 2004.

Slides:



Advertisements
Similar presentations
Adversarial Search Chapter 6 Sections 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Advertisements

Adversarial Search Chapter 6 Section 1 – 4. Types of Games.
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Two-Player Zero-Sum Games
Games & Adversarial Search
Adversarial Search Chapter 6 Section 1 – 4. Warm Up Let’s play some games!
Adversarial Search Chapter 6 Section 1 – 4.
Adversarial Search Chapter 5.
Adversarial Search Chapter 6.
Adversarial Search 對抗搜尋. Outline  Optimal decisions  α-β pruning  Imperfect, real-time decisions.
An Introduction to Artificial Intelligence Lecture VI: Adversarial Search (Games) Ramin Halavati In which we examine problems.
1 Adversarial Search Chapter 6 Section 1 – 4 The Master vs Machine: A Video.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Computers Playing Games Arif Zaman CS 101. Acknowledgements Portions of this are taken from MIT’s open-courseware
State Space 4 Chapter 4 Adversarial Games. Two Flavors Games of Perfect Information ◦Each player knows everything that can be known ◦Chess, Othello Games.
CPSC 322 Introduction to Artificial Intelligence October 25, 2004.
Centinel tournament ● A deck: the numbers in random order ● A game lasts until no numbers are left in deck ● A game is played like this (first player.
Strategies Based On Threats Ling Zhao University of Alberta March 10, 2003 Comparative evaluation of strategies based on the values of direct threats by.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
Min-Max Trees Based on slides by: Rob Powers Ian Gent Yishay Mansour.
Temperature Discovery Martin M ü ller, Markus Enzenberger and Jonathan Schaeffer zIntroduction: local and global search yLocal search algorithms yTemperature.
Choose A Subgame to Play by Zhichao “Leaf” Li October 20th, 2003.
Playing Konane Mathematically with Combinatorial Game Theory
Max Min Max Min Starting node and labels Figure 4.15 (pp. 148) MiniMax Search.
Combinatorial Games Martin Müller. Contents Combinatorial game theory Thermographs Go and Amazons as combinatorial games.
Game Tree Search based on Russ Greiner and Jean-Claude Latombe’s notes.
Choose A Subgame to Play by Zhichao “Leaf” Li August 1 st, 2003.
Adversarial Search: Game Playing Reading: Chess paper.
Games & Adversarial Search Chapter 6 Section 1 – 4.
Choose A Subgame to Play by Zhichao “Leaf” Li January 27 th, 2004.
You can type your own categories and points values in this game board. Type your questions and answers in the slides we’ve provided. When you’re in slide.
Game Playing State-of-the-Art  Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in Used an endgame database defining.
1 Adversary Search Ref: Chapter 5. 2 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans.
CSC 412: AI Adversarial Search
Game Playing.
Temperature Discovery Search Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature.
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
1 Adversarial Search CS 171/271 (Chapter 6) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Chalkboard Challenge Math 6 th Grade SOL Review 6.6ab, 6.11, 6.19, 6.20.
Amazons Experiments in Computer Amazons, Martin Mueller and Theodore Tegos, 2002 Exhaustive Search in the Game Amazons Raymond Georg Snatzke, 2002 Presented.
Game Theory, Part 2 Consider again the game that Sol and Tina were playing, but with a different payoff matrix: H T Tina H T Sol.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Special Games to Introduce Profit Grade 6-8. If the price for 50 marbles = Rp5000, how much each marble costs ?
MA471 Fall 2003 Lecture 2. On With The Games Today we are going to watch each group play a couple of rounds of cards. We will go through the game slowly.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Introduction to State Space Search
The Standard Genetic Algorithm Start with a “population” of “individuals” Rank these individuals according to their “fitness” Select pairs of individuals.
Adversarial Search. Regular Tic Tac Toe Play a few games. –What is the expected outcome –What kinds of moves “guarantee” that?
Adversarial Search Chapter 6 Section 1 – 4. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Adversarial Search Chapter 5 Sections 1 – 4. AI & Expert Systems© Dr. Khalid Kaabneh, AAU Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Machine Learning for Go
C ODEBREAKER Class discussion.
Dakota Ewigman Jacob Zimmermann
Games & Adversarial Search
Games & Adversarial Search
Games & Adversarial Search
Memory The game consists of 15 slides. There are 7 equations, 7 solutions, and one bonus space!! Begin by clicking once on any box. If you have an equation,
Games & Adversarial Search
Games & Adversarial Search
Presentation transcript:

Sum of Combinatorial Games by Leaf Wednesday, October 12th, 2004

Past Work Games with More than One Option Amazons Endgames Amazons Endgames vs. Random Games Games with Different Temperatures Future Work

Problem Description Given: Subgames in a Game Question: Play on which Subgame? Subgame 1: (left edge) 0 | -1 Subgame 2: (up edge) 0 | -2 || -3 Subgame 3: (bottom edge) 5 || 2 | 0

Methods of Choosing a Subgame Minimax Search Hotstrat: Choose the Subgame with highest temperature Hotstrat+: Consider Sente Thermostrat: Choose Subgame from Thermograph Depth-bounded αβ Search Temperature-bounded αβ Serach

Random Data (one option) 100 Games 5 Subgames/Game Only One Option in a Move In every Subgame: Format: a | b || c | d d = 0 c = d + random(50) b = c + random(50) a = b + random(50) 56 | 31 || 12 | | 63 || 48 | 0 68 | 54 || 17 | 0 60 | 19 || 9 | | 79 || 49 | 0

Random Data (many options) Based on Games with Only One Option For every move A|B, add one more option A, { A+Random(Δ) | A+Random(Δ) } | B, { B+Random(Δ) | B+Random(Δ) } We let Δ = 10 right now 50,{51|47}|12,{14|11}||8,{15|4}|0,{4|0} 58,{67|52}|23,{29|18}||8,{10|5}|0,{6|-6} 106,{114|99}|86,{88|81}||43,{46|39}|0,{1|-2} 50,{50|46}|38,{42|30}||1,{3|1}|0,{7|-4} 90,{99|85}|83,{92|81}||40,{40|33}|0,{0|-5}

Amazons Endgames In Combinatorial Game Suite, (CGSuite) Generate all Amazons Endgame with 3 arrows on 3x3 board Randomly pick up these endgames as subgames Temperatures are low, but with many options and depths {3|1,{2|-1,+-1}} {1/2,{1|1/2}|-2,{0|-2}} {1,{2|1/2,{1|*}}|-3} +-3 {3|-1/2*}

Minimax plays Left Minimax plays Right Hotstrat Thermostrat Depth-bounded αβ 3-ply Temperature-bounded αβ Match Results on Amazons Endgames Play 100 Games, with 20 Subgames in a Game Minimax vs. Minimax:

Match Results on Random Games Play 100 Games, with 5 2-level 2-option Subgames in a Game Difference from Minimax vs. Minimax (Minimax plays Left) Δ Hotstrat Thermostrat Depth-bounded αβ 3-ply Temperature-bounded αβ

Match Results on Random Games Play 100 Games, with 5 2-level 2-option Subgames in a Game Difference from Minimax vs. Minimax (Minimax plays Right) Δ Hotstrat Thermostrat Depth-bounded αβ 3-ply Temperature-bounded αβ

Some Guess from Results In Amazons Endgames, Depth-bounded αβ plays much better than others Temperature-bounded αβ is also better than Hotstrat and Thermostrat in Amazons Endgames In Random Games, the performance is similar to that in Amazons Endgames When Δ gets better, the difference between Strategies gets bigger

Future Work/Questions How to generate Endgames “look like” Amazons or Go Endgames? Why Depth-bounded αβ plays much better than Hotstrat? Others?