game tree

(redirected from Game-tree)

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 Section 3 we present the game-tree models used during the analysis and we describe the three observed factors.
We start building the game-tree models by assigning utility values to the terminal nodes from a uniform distribution over the interval [0,1].
The introduced measure of similarity is useful when we are dealing with game-tree models; however, local similarity in an arbitrary game is expressed in a different way.