the game tree is generally infinite.

Decision trees

A decision tree is a subtree of the game tree, with each position labelled "player A wins", "player B wins", or "draw" if that position can be proved to have that value (assuming best play by both sides) by examining only other positions in the graph. Terminal positions can be labelled directly--with player A to move, a position can be labelled "player A wins" if any successor position is a win for A; "player B wins" if all successor

1.Previous
3.Next