Game Tree

Содержание и основные понятия

Back to the table of contents
Alterna · Chapter 22 · page 22.3
Game Tree
All-intelligence games, minimax, alpha-beta.
The game tree is a private case of DAG. It contains every possible continuation of the game. The minimax algorithm finds its best course. Alpha Beta accelerates by a factor of 2 to 10.
GEF
PIF
EEG No. 23
01
Full-time games
In full-information games (chachmats, nick crosses), both players see the state, which allows the game tree to be used for analysis.
Unlike random games (nards with bones), in full-information games, the best course can be calculated (theoretically).
02
Minimax
Minimax: at max (First), take the maximum, at min (Second) is the minimum, and recursively from the bottom up.
For small trees (deep ≤ 6), it works perfectly; for large, alpha-beta or heuristics.
03
Nick cross: Minimax on Canvas
❌
Nil Crosses v. I.E. (minimex)
You play for
❌
, I.E., for
⭕
Твой ход!