Search and Game Playing

Slides:

Advertisements

Similar presentations

Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)

Advertisements

Game Playing Games require different search procedures. Basically they are based on generate and test philosophy. At one end, generator generates entire.

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.

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

Min-Max Trees Based on slides by: Rob Powers Ian Gent Yishay Mansour.

1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)

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.

Max Min Max Min Starting node and labels Figure 4.20 (pp. 153) Alpha-Beta Prune.

Alpha Beta Search how computers make decisions Elena Eneva 10 October 2001.

Monotonicity Admissible Search: “That finds the shortest path to the Goal” Monotonicity: local admissibility is called MONOTONICITY This property ensures.

Adversarial Search and Game Playing Examples. Game Tree MAX’s play  MIN’s play  Terminal state (win for MAX)  Here, symmetries have been used to reduce.

Game Playing: Adversarial Search Chapter 6. Why study games Fun Clear criteria for success Interesting, hard problems which require minimal “initial structure”

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.

Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.

873 8 [8,.] [.,8] [9,.] 8 [.,8] 24 [2,.] 1 [4,.]4 4.

Chapter 6 Adversarial Search. Adversarial Search Problem Initial State Initial State Successor Function Successor Function Terminal Test Terminal Test.

Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.

CSCI 4310 Lecture 6: Adversarial Tree Search. Book Winston Chapter 6.

GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.

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

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

Game-playing AIs Part 2 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part II  The Minimax Rule  Alpha-Beta Pruning  Game-playing.

Adversarial Search 2 (Game Playing)

Parallel Programming in Chess Simulations Part 2 Tyler Patton.

D Goforth - COSC 4117, fall OK administrivia  Exam format – take home, open book  Suicide rule for King’s court Illegal moves cannot move last.

February 25, 2016Introduction to Artificial Intelligence Lecture 10: Two-Player Games II 1 The Alpha-Beta Procedure Can we estimate the efficiency benefit.

Search: Games & Adversarial Search Artificial Intelligence CMSC January 28, 2003.

1 Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game.

Game Playing Why do AI researchers study game playing?

Adversarial Search and Game-Playing

By: Casey Savage, Hayley Stueber, and James Olson

Stochastic tree search and stochastic games

Alpha-Beta Pruning.

Iterative Deepening A*

PENGANTAR INTELIJENSIA BUATAN (64A614)

CS 460 Spring 2011 Lecture 4.

Optimizing Minmax Alpha-Beta Pruning Real Time Decisions

The Implementation of Machine Learning in the Game of Checkers

The Implementation of Machine Learning in the Game of Checkers

Dakota Ewigman Jacob Zimmermann

Chapter 6 : Game Search 게임 탐색 (Adversarial Search)

Tutorial 5 Adversary Search

Alpha-Beta Search.

Branch and Bound.

Game Playing: Adversarial Search

Gravity Off Win by finding a threat sequence

Kevin Mason Michael Suggs

NIM - a two person game n objects are in one pile

CS 171 Discussion Session Week 3

Alpha-Beta Search.

The Alpha-Beta Procedure

Introduction to Artificial Intelligence Lecture 9: Two-Player Games I

Alpha-Beta Search.

Approaches to search Simple search Heuristic search Genetic search

Game Playing Fifth Lecture 2019/4/11.

Alpha-Beta Search.

Game Playing: Adversarial Search

Based on slides by: Rob Powers Ian Gent

Artificial Intelligence

Game Playing Chapter 5.

Adversarial Search and Game Playing Examples

Adversarial Search CMPT 420 / CMPG 720.

Adversarial Search CS 171/271 (Chapter 6)

Alpha-Beta Search.

Games & Adversarial Search

Adversarial Search Game Theory.

Unit II Game Playing.

Presentation transcript:

Search and Game Playing We will focus on Board Games We will represent the game as a tree The node is a game tree represent board configuration, and the branches indicate how moves can connect them. Original Board A Situation New Board Situation B C New Board Situation D E F G

The Minimax Procedure Maximizing Level Minimizing Level 3 Maximizing Level A 3 2 Minimizing Level B C Maximizing Level D E F G 3 6 2 7

Alpha Beta Pruning Maximizing Level Minimizing Level Maximizing Level =3 >=3 Maximizing Level A =3 Minimizing Level B =<2 C Maximizing Level 3 6 2

Alpha Beta Pruning Maximizing Level Minimizing Level Maximizing Level 50 50 40 70 10 60 30 80 90 20 50 Maximizing Level 50 30 20 Minimizing Level 70 30 20 50 Maximizing Level Winston Page 107 to 109