We will be describing the subset of the computer chess based search enhancements that we use in our pathfinding code at BioWare. The successors of the best state, si, are generated and examined in turn. For The Sliding-Tile Puzzle. An example of the sliding-tile puzzle can be found in Figure 1. Zero-sum implies that if one player wins, the other player loses.
Perfect information implies the entire state of the game is known at any time.
Scrabble has hidden tiles, and is defined as a game of imperfect information. In any position for a game in this category, an optimal move can be determined. However, all hope is not lost, since there are alternative formulations of the minimax algorithm that involve searching a game tree . All rights reserved.