Leaf Node

From Chessprogramming wiki
Jump to: navigation, search

Home * Search * Node * Leaf Node

M. C. Escher, Dewdrop, 1948 [1]

Leaf nodes are nodes with no further successors. They are either terminal nodes or nodes where the desired depth from the root is accomplished and which has been assigned a heuristic value as an "educated guess" to an approximate of a terminal value. Each search tree has at least one leaf node.

See also

External Links


Up one Level