From game trees to game graphs
W.T.M. Kars · 1990
We extend the definition of the score of a game tree using the minimax rule to game graphs containing cycles. This is accomplished by taking the limit of a sequence of scores of game trees that in some sense approximate the game graph. We show that this score is well-defined for all game graphs, and give algorithms for its evaluation, including one that uses memoization.