Game tree
Tree diagram used to find and analyze potential moves in a game
In the context of combinatorial game theory, a game tree is a graph representing all possible game states within a sequential game that has perfect information. Such games include chess, checkers, Go, and tic-tac-toe.
Nº Q1377033 ★
Common · Knowledge
Game tree
Tree diagram used to find and analyze potential moves in a game
In the context of combinatorial game theory, a game tree is a graph representing all possible game states within a sequential game that has perfect information. Such games include chess, checkers, Go, and tic-tac-toe.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In the context of combinatorial game theory, a game tree is a graph representing all possible game states within a sequential game that has perfect information. Such games include chess, checkers, Go, and tic-tac-toe. A game tree can be used to measure the complexity of a game, as it represents all the possible ways that the game can pan out. Due to the large game trees of complex games such as chess, algorithms that are designed to play this class of games will use partial game trees, which makes computation feasible on modern computers. Various methods exist to solve game trees. If a complete game tree can be generated, a deterministic algorithm, such as backward induction or retrograde analysis can be used. Randomized algorithms and minmax algorithms such as MCTS can be used in cases where a complete game tree is not feasible.
Text: Wikipédia, CC BY-SA 4.0. · Image: Traced by User:Stannered, original by en:User:Gdr (CC BY-SA 3.0) ·
Related cards
Combinatorial game theory
Branch of game theory about two-player sequential games with perfect information
Nº Q1320931 ★
Tree (graph theory)
Undirected, connected and acyclic graph
Nº Q272735 ★★★
Behavior tree (artificial intelligence, robotics and control)
Control method
Nº Q18205497 ★
Binary tree
Tree data structure in which each node has at most two children
Nº Q380172 ★★★
Monte Carlo tree search
Heuristic search algorithm based on random sampling
Nº Q11785332 ★★
Computer Go
Field of artificial intelligence dedicated to creating a computer program that plays Go
Nº Q1207836 ★★