Live briefing
Everything about Game tree
Combinatorial game theory concept to represent all possible game states
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Game treeA 5-minute orientation
- Skim a recent paper: Churn prediction in digital game-based learning using data mining techniques: Logistic regression, decision tree, and random forestInfluential work since 2022
- Pick up a classic book: Hour of the OlympicsThe most-reprinted book on the subject
- Read the landmark paper: Mastering the game of Go with deep neural networks and tree searchCited 12,028 times
- Go sideways: Alpha–beta pruningA closely related topic
- Go sideways: MinimaxA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Mastering the game of Go with deep neural networks and tree search
Game tree searching by min/max approximation
The kernel/nucleolus of a standard tree game
Parallel Game-Tree Search
GAME-TREE SEARCH ALGORITHM BASED ON REALIZATION PROBABILITY
Game Tree Search-based Impulsive Orbital Pursuit–Evasion Game with Limited Actions
The Stackelberg Minimum Spanning Tree Game
Distributed game-tree searching
🆕 Influential since 2022
Churn prediction in digital game-based learning using data mining techniques: Logistic regression, decision tree, and random forest
The Tree Reconstruction Game: Phylogenetic Reconstruction Using Reinforcement Learning
Remote State Estimation Under DoS Attacks in CPSs With Arbitrary Tree Topology: A Bayesian Stackelberg Game Approach
NCCollab: collaborative behavior tree authoring in game development
Reconstruction of Tree Network via Evolutionary Game Data Analysis
📚 Books worth reading
Hour of the OlympicsMary Pope Osborne · 1986
BalloonSterling/Balloon · 1998
Two Brown BearsMartin Waddell · 2002
Spielbaum-SuchverfahrenAlexander Reinefeld · 1989- 📕The fulvous tree duck in LouisianaRobert Bruce McCartney · 1963
The haunted forestG. Warren Schloat · 1961- 📕Woody plants of Iowa recommended for game coverIowa. State Planning Board, Iowa State Conservation Commission. Biological Survey Unit · 1935
Upland game birds and their favorite foodsGame Food Nurseries · 1951
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Alpha–beta pruning Alpha–beta pruning is a tree search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree…
- Minimax Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics…
- Game complexity Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)…
- Monte Carlo tree search In computer science, Monte Carlo tree search (MCTS) is a heuristic tree search algorithm for some kinds of decision processes, most notably those employed…
- Glossary of computer chess terms The glossary of computer chess terms explains commonly used terms in computer chess, in alphabetical order. For terms used in chess in general, see Glossary…
- Solved game A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly. This…
- Negamax Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that min(a…
- Parity game A parity game is played on a colored directed graph, where each node has been colored by a priority – one of (usually) finitely many natural numbers. Two…