Game tree


The game lot can be saved as alternate, alternating moves of both players (Double player). Game Tree - A representation that allows you to describe situations that can be reached after the player moves. Tree nodes are a representation of individual situations on the board. Each node must specify what information the player should perform. Level 0 is the level of the player, the next level is the level of the opponent, etc.

Branches represent all possible players movements.

The number of leaves (knots of degree 1) in the complete game tree is called the complexity of the game. This is the number of possible ways to play the game. For example, the complexity of the classic "circle and cross" game is 26830.

Game trees are important in artificial intelligence because one way to choose the best motion in the game is to search the game tree using the minimax algorithm or variants. The game wheel for "wheels and crosses" is easy to search, but complete game trees for larger games (like chess) are too big. Instead, programs that play chess, for example, search the game's trees for as long as they allow for a predetermined amount of time.

With the complete tree of the game, you can "solve" the game - that is, find the sequence of moves that always leads one player to victory, or guarantee a tie.

wiki

Comments

Popular posts from this blog

Pupo Román

Myrmex Indikos

Names of streets and squares