Difference between revisions of "Leaf node"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In Tree data structures, a '''leaf node''' is a node with no children. == Game trees == In game theory, a '''game tree''' is a directed graph whose Ver...") |
(No difference)
|
Latest revision as of 17:03, 9 May 2016
In Tree data structures, a leaf node is a node with no children.
Game trees
In game theory, a game tree is a directed graph whose nodes are positions in a game and whose edges are moves.
The number of [[leaf nodes in the complete game tree is the number of possible different ways the game can be played.
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.
See also
- Alpha-beta pruning
- And–or tree
- Directed graph
- Edge (graph theory)
- Extensive form game
- Game complexity
- Game theory
- Shannon number
- Tree (data structure)
- Vertext (graph theory)
External links
--Karl Jones (talk) 17:03, 9 May 2016 (MDT)
