Home * Search * Node * Leaf Node

		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.
M. C. Escher, Dewdrop, 1948 ^[1]

External Links

References

Page	Date Edited
Alexander Szabo	Nov 10, 2012
Alpha-Beta	Jan 28, 2018
APHID	Jun 26, 2017
Blockage Detection	Oct 19, 2017
Branching Factor	Jun 28, 2017
ChessBrain	Jun 28, 2017
Conspiracy Numbers	Dec 29, 2017
Constellation	Oct 2, 2016
Daniel Edwards	Jan 19, 2018
Depth-First	Jun 25, 2016
Dictionary	Aug 24, 2017
Enhanced Transposition Cutoff	May 19, 2017
Falcon	Sep 2, 2016
Fixafan	Oct 2, 2015
Francesca	Jan 7, 2016
Frontier Nodes	Dec 29, 2013
Gerhard Trippen	Jun 8, 2015
Gromit	Apr 5, 2017
Horizon Node	Sep 13, 2016
Interior Node	Aug 6, 2012
Kaissa	Apr 9, 2018
Lachex	Jan 7, 2016
Leaf Node	Mar 4, 2017
Leftmost Node	May 28, 2011
MCαβ	Jan 28, 2018
Michael Levin	Sep 10, 2013
Monte-Carlo Tree Search	Apr 26, 2018
Movei	Jan 7, 2016
Node	Jul 20, 2015
Node Types	Oct 22, 2017
Nodes per second	Feb 28, 2018
Nuchess	Apr 3, 2017
Odd-Even Effect	May 19, 2017
Oracle	Sep 4, 2016
Ostrich	Dec 28, 2017
Perft	Sep 26, 2017
Perft Results	Feb 10, 2018
Playing Strength	Mar 31, 2018
Point Value by Regression Analysis	Aug 26, 2017
Quiescent Node	Feb 10, 2017
Richard P. Cochran	Mar 28, 2015
Score	Apr 14, 2018
Search Tree	Dec 23, 2016
Search with Random Leaf Values	Apr 23, 2018
Shu Yokoyama	Oct 25, 2017
Singular Extensions	Jan 9, 2018
SOMA	Mar 25, 2015
Super Constellation	Oct 1, 2016
TechMate	Aug 23, 2014
Temporal Difference Learning	Feb 20, 2018
Terminal Node	Nov 17, 2012
Timothy Hart	Aug 22, 2014
Ulysses	Nov 1, 2016

Up one Level