Ch 5 adversarial search
Download
1 / 5

- PowerPoint PPT Presentation


  • 70 Views
  • Uploaded on

Ch. 5 – Adversarial Search. Supplemental slides for CSE 327 Prof. Jeff Heflin. Tic-Tac-Toe Transition Model. O to bottom-center. O to top-left. O to top-center. O to top-right. Minimax Algorithm.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about '' - haig


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Ch 5 adversarial search

Ch. 5 – Adversarial Search

Supplemental slides for CSE 327

Prof. Jeff Heflin


Tic tac toe transition model
Tic-Tac-Toe Transition Model

O tobottom-center

O to top-left

O totop-center

O to top-right


Minimax algorithm
Minimax Algorithm

function Minimax-Decision(state) returns an action returnargmaxa  ACTIONS(s)C(Result(state,a))

function Max-Value(state) returns a utility valueif Terminal-Test(state) then return Utility(state)v -for each ainActions(state) dovMax(v, Min-Value(Result (s,a)))return v

function Min-Value(state) returns a utility valueif Terminal-Test(state) then return Utility(state)v +for each a in Actions(state) dovMax(v, Min-Value(Result (s,a)))return v

From Figure 5.3, p. 166


Utility based agent
Utility-Based Agent

sensors

State

What the world is like now

How the world evolves

What it will be like if I do action A

What my actions do

Environment

How happy will I be in such a state

Utility

What action I should do now

Agent

actuators


Minimax with cutoff limit
Minimax with Cutoff Limit

function Minimax-Decision(state) returns an action returnargmaxa  ActionS(s)Min-Value(Result(state,a),0)

function Max-Value(state,depth) returns a utility valueif Cutoff-Test(state,depth) then return Eval(state)v -for each ainActions(state) dovMax(v, Min-Value(Result(s,a)), depth+1)return v

function Min-Value(state,depth) returns a utility valueif Cutoff-Test(state,depth) then return Eval(state)v +for each a in Actions(state) dovMin(v, Max-Value(Result(s,a)), depth+1)return v