This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Leaf Node

Home * Search * Node * Leaf Node

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

  1. M. C. Escher, Dewdrop, 1948, Picture gallery "Back in Holland 1941 - 1954" from The Official M.C. Escher Website↩︎

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

Watch on YouTube

References

Up one Level

Categories: M. C. Escher · Klaus Schulze

What links here

Contributors: GerdIsenberg.