Game Tree
Version 1.0.0 · Updated 2026-07-28
CORE DEFINITION
A game tree represents possible paths of play through nodes and branches, with terminal nodes marking outcomes or payoffs. In perfect-information sequential games such as board games, it supports move search. An economic game’s extensive-form representation also needs decision makers, information sets, and any chance nodes; an unannotated tree does not express all strategic conditions.
SCAFFOLDING EFFECT
Reduce cognitive load
Turn possible responses to an action into explicit conditional branches, checking order of play, visible information, and each participant’s interests. In a finite perfect-information model with specified payoffs, backward induction can test whether a threat is credible. Its conclusions depend on the assumptions rather than guaranteeing an actual opponent’s behavior.
Anchor fast decisions
The tree decomposes complete paths into choices at decision nodes. In a finite perfect-information game, selecting optimal branches backwards using each acting player’s payoff can construct a subgame-perfect equilibrium; payoff ties may permit multiple solutions. With non-singleton information sets, a player cannot choose differently at nodes they cannot distinguish, so analysis must respect those information constraints.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E7%AB%B6%E8%B3%BD%E6%A8%B9verified
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Game_treeverified
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Extensive-form_gameverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS