Introduction to Artificial Intelligence - 11

Figure 2.38. Cut the root subtree a if eval(u)>eval(v) Then we have the value of White vertex c at least the value of u, the value of Black vertex b at most the value of v. Therefore, if eval(u) > eval(v) we do ...

Home Reference Doccument