Game Trees.ppt

Game Trees Introduction toArtificial Intelligence COS302 Michael L. Littman Fall 2001 Administration Questions? Anything on Rush hour? HW reminder: Opportunity for feedback. Not seeking perfection! Search in Games Consider tic-tac-toe as a search problem. States, neighbors, goal? Problem Path to goal isn’t quite right. Game Model X: states for player 1 (max) to go Y: states for player 2 (min) to go N(s): Set of states neighboring s G(s): 0, game continues; 1, game ends V(s): score for ending in state s (Assume alternation: simpler.) Nim: Example Game n piles of sticks, ci sticks in pile i X: