CS4600 - Homework 8 - Game Playing1. What is the minimax value of the root node of the above game tree? Cross out the node(s)whose value(s) the alpha-beta method never determines, assuming that it always generates theleftmost successor node ﬁrst. Determine the alpha and beta values of the remaining nodes(s).2. Assume that you are given a version of the alpha-beta method that is able to take advantage ofthe 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
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.