1 / 4

Ch. 6 – Adversarial Search

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

ketan
Download Presentation

Ch. 6 – Adversarial Search

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Ch. 6 – Adversarial Search Supplemental slides for CSE 327 Prof. Jeff Heflin

  2. Tic-Tac-Toe Successor Function O tobottom-center O to top-left O totop-center O to top-right

  3. Minimax Algorithm function MINIMAX-DECISION(state) returns an action v  MAX-VALUE(state)return the action in SUCCESSORS(state) with value v function MAX-VALUE(state) returns a utility valueif TERMINAL-TEST(state) then return UTILITY(state)v -for each <a,s> in SUCCESSORS(state) dov MAX(v, MIN-VALUE(s))return v function MIN-VALUE(state) returns a utility valueif TERMINAL-TEST(state) then return UTILITY(state)v +for each <a,s> in SUCCESSORS(state) dov MIN(v, MAX-VALUE(s))return v From Figure 6.3, p. 166

  4. Minimax with Cutoff Limit function MINIMAX-DECISION(state) returns an action v  MAX-VALUE(state, 0)return the action in SUCCESSORS(state) with value v function MAX-VALUE(state, depth) returns a utility valueif CUTOFF-TEST(state, depth) then return EVAL(state)v -for each <a,s> in SUCCESSORS(state) dov MAX(v, MIN-VALUE(s, 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,s> in SUCCESSORS(state) dov MIN(v, MAX-VALUE(s, depth + 1))return v

More Related