In a previous article, we considered game trees as graphical models. Adopting an evaluation function that returned a probability distribu- Tion over values likely to be taken at a given position, we described how To build a model of uncertainty and use it for utility-directed growth of The search tree and for deciding on a move after search was completed. In Some games, such as chess and Othello, the same position can occur more Than once, collapsing the game tree to a directed acyclic graph (DAG). This induces correlations among the distributions at sibling nodes.
展开▼
