CS4600  Homework 8  Game Playing
1. What is the minimax value of the root node of the above game tree? Cross out the node(s)
whose value(s) the alphabeta method never determines, assuming that it always generates the
leftmost successor node ﬁrst. Determine the alpha and beta values of the remaining nodes(s).
2. Assume that you are given a version of the alphabeta method that is able to take advantage of
the information that all node values are integers that are at least 1 and at most 6. Determine ALL
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 09/10/2008 for the course CS 460 taught by Professor Svenkoenig during the Fall '08 term at Urbana.
 Fall '08
 SvenKoenig

Click to edit the document details