Choose A Subgame to Play by Zhichao “Leaf” Li January 27 th, 2004.

Slides:

Advertisements

Similar presentations

Markov Decision Process

Advertisements

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.

Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.

This lecture topic: Game-Playing & Adversarial Search

Games & Adversarial Search

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.

1 CSC 550: Introduction to Artificial Intelligence Fall 2008 search in game playing  zero-sum games  game trees, minimax principle  alpha-beta pruning.

CS 484 – Artificial Intelligence

1 Game Playing. 2 Outline Perfect Play Resource Limits Alpha-Beta pruning Games of Chance.

Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.

Adversarial Search CSE 473 University of Washington.

Artificial Intelligence for Games Game playing Patrick Olivier

Adversarial Search 對抗搜尋. Outline  Optimal decisions  α-β pruning  Imperfect, real-time decisions.

Search Strategies.  Tries – for word searchers, spell checking, spelling corrections  Digital Search Trees – for searching for frequent keys (in text,

10/19/2004TCSS435A Isabelle Bichindaritz1 Game and Tree Searching.

Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.

State Space 4 Chapter 4 Adversarial Games. Two Flavors Games of Perfect Information ◦Each player knows everything that can be known ◦Chess, Othello Games.

All rights reservedL. Manevitz Lecture 31 Artificial Intelligence A/O* and Minimax L. Manevitz.

Using Search in Problem Solving

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.

Find a Path s A D B E C F G Heuristically Informed Methods  Which node do I expand next?  What information can I use to guide this.

Choose A Subgame to Play by Zhichao “Leaf” Li October 20th, 2003.

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

Combinatorial Games Martin Müller. Contents Combinatorial game theory Thermographs Go and Amazons as combinatorial games.

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.

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.

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.

CISC 235: Topic 6 Game Trees.

Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.

Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.

Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.

1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah

October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.

Traditional game playing 2 player adversarial (win => lose) based on search but... huge game trees can't be fully explored.

Temperature Discovery Search Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature.

University of Amsterdam Search, Navigate, and Actuate – Search through Game Trees Arnoud Visser 1 Game Playing Search the action space of 2 players Russell.

Othello Playing AI Matt Smith. Othello 8x8 Board game 8x8 Board game Try to outflank opponents pieces Try to outflank opponents pieces Winner ends up.

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.

Search exploring the consequences of possible actions.

Cilk Pousse James Process CS534. Overview Introduction to Pousse Searching Evaluation Function Move Ordering Conclusion.

Game Playing Revision Mini-Max search Alpha-Beta pruning General concerns on games.

ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.

Graph Search II GAM 376 Robin Burke. Outline Homework #3 Graph search review DFS, BFS A* search Iterative beam search IA* search Search in turn-based.

Adversarial Search Chapter 6 Section 1 – 4. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time.

Adversarial Search 2 (Game Playing)

Adversarial Search and Game Playing Russell and Norvig: Chapter 6 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2004/home.htm Prof: Dekang.

Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)

Unit 2 Day 11 FOCS – Human Computer Interaction. Tower Building Presentation Explain your solution.

Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.

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.

Adversarial Search and Game Playing (Where making good decisions requires respecting your opponent) R&N: Chap. 6.

Dakota Ewigman Jacob Zimmermann

Games & Adversarial Search

Games & Adversarial Search

Games & Adversarial Search

Games & Adversarial Search

Based on slides by: Rob Powers Ian Gent

Games & Adversarial Search

Games & Adversarial Search

Presentation transcript:

Choose A Subgame to Play by Zhichao “Leaf” Li January 27 th, 2004

Choose a Subgame to Play Problem Description Previous Work Recent Work Recent Experiments Some New Results Future Experiments and Work

Problem Description Given a Game with Several Subgames Subgame 1: 0 | -1 Subgame 2: 0 | -2 || -3 Subgame 3: 5 || 2 | 0 Problem: Choose Which Subgame to Play?

Privious Work Minimax Sort Moves by Temperatures Prune Moves by Incentives Hotstrat Thermostrat Depth-bounded Alphabeta Search use Hotstrat Rollouts

Recent Work Minimax Iterative Deepening Try Playing ‘Best Move’ First Static Evaluation Hotstrat Rollouts Static Function: Sum of Means of Subgames (with/without half Highest Temperature bonus) Temperature-bounded Alphabeta Search

Sort Moves in Minimax (2-level) IncentivePruning = off Temp = Sort by Temperature Best = Play Best Move first Run Time in 2-Level Games Temp Best No No No Yes Yes No Yes Yes

Sort Moves in Minimax (3-level) IncentivePruning = off Temp = Sort by Temperature Best = Play Best Move first Run Time in 3-Level Games Temp Best No No No Yes Yes No Yes Yes

Sum of Means vs Hostrat Rollouts When use Sum of Means as static function, could not tell with or without t/2 bonus better Sum of Means is faster than Hotstrat Rollouts, but Sum of Means is not as precise as Hotstrat Rollouts

Sum of Means vs Hostrat Rollouts level 5-Subgame Games: no t/2 with t/2 hotstrat rollouts MinMin - DepMin MinDep - MinMin level 5-Subgame Games: no t/2 with t/2 hotstrat rollouts MinMin - DepMin MinDep - MinMin

Temperature-bounded Alphabeta Search Set a Temperature Bound, when the highest temperature is lower than it, stop search Now, we set the bound = Highest Temperature * Factor (=0.8) What Factor should be as best?

Depth-bounded vs Temperature -bounded use static evaluation, Depth-bounded is better than Temperature-bounded; use hotstrat rollouts, temperature-bounded is better in most cases

Future Work How to set the bound for Temperature- bounded search? Other methods to improve Alphabeta search? Try to apply the strategies on some practical endgames Others?