2015AI课件lec6敌对搜索.pptVIP

α-β Procedure The alpha values of MAX nodes can never decrease. The beta values of MIN nodes can never increase. α-β Procedure P204 1. 2. explication 1中β值可能不够准确，因为可能还有很多子节点没有生成，但不会影响MAX选最佳节点作为后继，因为MIN节点不会比α大。 2中α 值可能不够准确，因为可能还有很多子节点没有生成，但不会影响MIN选最佳节点作为后继，因为MAX节点不会比β小。 a b c d e f g MAX MAX MIN MIN ? 4 -5 -2 α-β Procedure -2 ≤ -2 β=-2 ≥ 4 α=4 α-β Procedure a b c d e f g MAX MAX MIN MIN ? 4 -3 ≤ -3 β=-3 h i ? ≥ 4 α=4 MAX Adversarial Search 敌对搜索 12.6 Games of chance 概率博弈 Eg: backgammon 西洋双陆棋 MAX’s and MIN’s turns now each involve a throw of the dice. Imagine that at each dice throw, a fictitious third player, DICE, makes a move. Eg: backgammon Games of chance Expectimaxing 期望的最大值 Back up the expected (average) values of the values of the successors instead of a maximum or minimum. Back up the minimum value of the values of successors of nodes for which it is MIN’s move, the maximum value of the values of successors of nodes for which it is MAX’s move, and the expected value of the values of successors of nodes for which it is the DICE’s move. Games of chance Introducing a chance move often makes the game tree branch too much for effective searching. Important to have a good static evaluation function Homework 12.1 12.2 12.4 Adversarial Search 敌对搜索 付 岩 Fuyan@hrbeu.edu.cnAdversarial Search 敌对搜索 12.1 Two-Agent Games 双Agent博弈 Characteristics Two agents Move in turn Perfect-information Zero-sum Eg1:Two Robots in Grid World Two Robots in Grid World Figure 12.1 Figure 12.2 Part of the Search Tree for the Moves of Two Robots ? Eg2: Grundy’s Game Rules of Grundy’s Game Given a heap of size n. Two players alternately select a heap and divide it into two unequal heaps. A player loses when he cannot make a legal move because all heaps have size 1 or 2. Key Figure 12.2 The Search Tree for Grundy’s Game N = 7 ?...? Eg3: Chinese Chess Possible to enumerate all the states? 50 steps 10161 states 1 millimicrosecond for a ste