| 11. | Nature's choice is represented in the game tree by a non-filled node.
|
| 12. | Therefore the game tree size has an upper bound of approx . 100 43 = 10 86.
|
| 13. | Maven uses the B-star search algorithm to analyse the game tree during the endgame phase.
|
| 14. | Some games with relatively small game trees have been proven to be first or second player wins.
|
| 15. | For example, the game tree for tic-tac-toe has 255, 168 leaf nodes.
|
| 16. | Extensions of ID also find their use in game theory as an alternative representation of the game tree.
|
| 17. | Negamax performance improves particularly for game trees with many paths that lead to a given node in common.
|
| 18. | Such considerations, taken on all levels of the game tree, are known as alpha-better pruning.
|
| 19. | The game tree in Monte Carlo tree search grows asymmetrically as the method concentrates on the more promising subtrees.
|
| 20. | Domain-specific knowledge may be employed when building the game tree to help the exploitation of some variants.
|
