Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Game_tree> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Game_tree abstract "In game theory, a game tree is a directed graph whose nodes are positions in a game and whose edges are moves. The complete game tree for a game is the game tree starting at the initial position and containing all possible moves from each position; the complete tree is the same tree as that obtained from the extensive-form game representation.The diagram shows the first two levels, or plies, in the game tree for tic-tac-toe. The rotations and reflections of positions are equivalent, so the first player has three choices of move: in the center, at the edge, or in the corner. The second player has two choices for the reply if the first player played in the center, otherwise five choices. And so on.The number of leaf nodes in the complete game tree is the number of possible different ways the game can be played. For example, the game tree for tic-tac-toe has 255,168 leaf nodes.Game trees are important in artificial intelligence because one way to pick the best move in a game is to search the game tree using the minimax algorithm or its variants. The game tree for tic-tac-toe is easily searchable, but the complete game trees for larger games like chess are much too large to search. Instead, a chess-playing program searches a partial game tree: typically as many plies from the current position as it can search in the time available. Except for the case of "pathological" game trees (which seem to be quite rare in practice), increasing the search depth (i.e., the number of plies searched) generally improves the chance of picking the best move.Two-person games can also be represented as and-or trees. For the first player to win a game, there must exist a winning move for all moves of the second player. This is represented in the and-or tree by using disjunction to represent the first player's alternative moves and using conjunction to represent all of the second player's moves.".
- Game_tree thumbnail Tic-tac-toe-game-tree.svg?width=300.
- Game_tree wikiPageID "267355".
- Game_tree wikiPageRevisionID "582400005".
- Game_tree hasPhotoCollection Game_tree.
- Game_tree subject Category:Combinatorial_game_theory.
- Game_tree subject Category:Trees_(graph_theory).
- Game_tree comment "In game theory, a game tree is a directed graph whose nodes are positions in a game and whose edges are moves. The complete game tree for a game is the game tree starting at the initial position and containing all possible moves from each position; the complete tree is the same tree as that obtained from the extensive-form game representation.The diagram shows the first two levels, or plies, in the game tree for tic-tac-toe.".
- Game_tree label "Drzewo gry".
- Game_tree label "Game tree".
- Game_tree label "Árbol de juego".
- Game_tree label "ゲーム木".
- Game_tree label "遊戲樹".
- Game_tree sameAs Árbol_de_juego.
- Game_tree sameAs ゲーム木.
- Game_tree sameAs 게임_트리.
- Game_tree sameAs Drzewo_gry.
- Game_tree sameAs m.01njny.
- Game_tree sameAs Q1377033.
- Game_tree sameAs Q1377033.
- Game_tree wasDerivedFrom Game_tree?oldid=582400005.
- Game_tree depiction Tic-tac-toe-game-tree.svg.
- Game_tree isPrimaryTopicOf Game_tree.