Friday, February 19, 2010

Adding alpha –beta cutoffs

The alpha-beta cutoff strategy required the maintenance of two threshold values, one that represents a lower bound on the value that a maximizing node may have and another that represents an upper found on the value that a minimizing node may be assigned.

2. Else, generate one more branch for the tree by the function GEN (position, player) and setting SUCCESSOR to its returned list.

3. If SUCCESSOR is empty, then there are no moves to be made, so return back to DEEP the same structure that you would have returned if SUCCESSOR had returned true.

4. Else, if SUCCESSOR is not empty, examine each element and keep track of the best one.

No comments: