game tree


Also found in: Wikipedia.

game tree

[′gām ‚trē]
(mathematics)
A tree graph used in the analysis of strategies for a game, in which the vertices of the graph represent positions in the game, and a given vertex has as its successors all vertices that can be reached in one move from the given position. Also known as lookahead tree.

game tree

(games)
A tree representing contingencies in a game. Each node in a game tree represents a possible position (e.g., possible configuration of pieces on a chessboard) in the game, and each branching ("edge" in graph terms) represents a possible move.
References in periodicals archive ?
In a cyber deception game, the defender's game tree might look very different from that of the attacker, and the hypergame model can encompass all of the subgame trees as they are played out for each individual player's perception of the game.
An infinite game tree is an infinite oriented treelike graph K = (Z, F) with the root Zq, where Z is the set of vertices and [F.sub.z] is the set of vertices following after z and F : Z [right arrow] [2.sup.Z], F(z) = [F.sub.Z] [subset] Z, z [member of] Z.
The topics include supporting practices in professional communities using mobile cloud services, cloud-based intelligent tutoring mechanism for pervasive learning, multiple-query processing and optimization techniques for multi-tenant databases, developing a framework for the desktop grid federation of game tree search applications, standardized multimedia data in health-care applications, and digital rights management in the cloud.
The extensive form game is usually pictured by way of a game tree, which consists of choice nodes and terminal nodes: (1) choice nodes are labeled with players and each outgoing edge is labeled with an action for that player; (2) terminal nodes are labeled with utilities.
* Deer Stands: Big Game Tree Stands, The Blynd, Dillon Manufacturing
Move sequences are returned during the searching of the chess game tree that cause a cutoff, or determine that certain parts of the tree do not need to be searched further.
Keywords: minimin, LRTS, pathology, game tree, single-agent search
For example, using von Neumann and Morgenstern's (1944) extensive form representation of n-person games, Shenoy (1998) suggested the use of a game tree representation for decision analysis.
Probabilistic analysis for randomized game tree evaluation.
In the trust game tree, the top (bottom) number is the first (second) mover's payoff.
Here Brams introduces the reader to two valuable tools used by rational choice, including the game tree and the outcome matrix.
Strategic Gaming provided the insights Nash needed to solve the dilemma, and it helped Nash executives create a "dynamic roadmap." First, the Nash team mapped out Genius and Smart's choices, in sequence, with a "game tree" diagram to represent the structure of the situation.