Difference between revisions of "Leaf Node"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Search * Node * Leaf Node''' FILE:EschersDewdrop.jpg|border|right|thumb|249px|link=http://www.mcescher.com/Gallery/back-bmp/LW356.jpg|[[Arts...")
 
m
Line 21: Line 21:
  
 
'''[[Node|Up one Level]]'''
 
'''[[Node|Up one Level]]'''
 +
[[Category:M. C. Escher]]

Revision as of 17:10, 14 May 2018

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

References

Up one Level