This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MIT EECS 6.034: Artificial Intelligence (Fall 2006) Instructor: Luis E. Ortiz Practice Problems on Search in Games Original date: October 8, 2005; Last revised: October 22, 2006 For all the problems in this document, Minimax refers to the minimax algorithm, while Alpha Beta refers to minimax with alphabeta pruning. 1. Consider the following game tree. MAX V K W P Q R S T L E F G H J U C B A D I M N O 9 1 2 7 5 3 1 5 9 2 6 8 3 9 MAX MIN MAX MIN Assume that the children of each node are evaluated from left to right. (a) Use the Minimax to compute the value of each node in the game tree. (b) List the nodes that are evaluated by AlphaBeta . (c) Redraw the game tree such that AlphaBeta performs the minimum number of evalu ations (i.e., the best case for AlphaBeta ). How many nodes are evaluated by Alpha Beta in the resulting game tree? (d) Redraw the game tree such that AlphaBeta performs the maximum number of eval uations (i.e., the worst case for AlphaBeta ). How many nodes are evaluated by AlphaBeta in the resulting game tree?...
View
Full
Document
This note was uploaded on 10/23/2011 for the course ENCS ENCS5 taught by Professor Abdelsalam during the Spring '10 term at Birzeit University.
 Spring '10
 ABDELSALAM

Click to edit the document details