25,161
edits
Changes
Root
,Created page with "'''Home * Search * Node * Root''' The '''Root''' of the Search Tree is the initial position of the search. Many progra..."
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Root'''
The '''Root''' of the [[Search Tree]] is the initial [[Chess Position|position]] of the [[Search|search]]. Many programmers dedicate a separate function for doing a root search, since using a different [[Move Ordering|move ordering]] scheme may be beneficial. Also root search must return not only the value, but also the [[Best Move|move]] which will be played. This in turn may require special care in case of a fail-low when using [[Aspiration Windows|aspiration window]]. This is typically where the [[Time Management|time management]] decisions are beneficial.
=See also=
* [[Conspiracy Numbers]]
* [[Fail-Low]]
* [[Iterative Deepening]]
* [[Principal Variation#MultiPV|Multi-PV]]
* [[Oracle]]
* [[Piece-Square Tables#Preprocessing|Piece-Square Tables - Pre-processing]]
* [[Ronald de Man#ScoringRootMoves|Scoring Root Moves]] by [[Ronald de Man]]
* [[Time Management]]
=Forum Posts=
==1997 ...==
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 1, 1997
: [http://groups.google.com/group/rec.games.chess.computer/msg/0df39371422a600c Re: computer chess "oracle" ideas...] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], April 3, 1997
: [http://groups.google.com/group/rec.games.chess.computer/msg/ccc2546e26d92f88 Re: computer chess "oracle" ideas...] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], April 7, 1997
* [https://www.stmintz.com/ccc/index.php?id=23672 Failing low at the root] by [[Guido Schimmels]], [[CCC]], August 03, 1998
* [https://www.stmintz.com/ccc/index.php?id=84651 Question: Fail High then Low at Root] by [[William Bryant]], [[CCC]], December 28, 1999 » [[Fail-High]], [[Fail-Low]], [[Search Instability]]
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=93686 Can we use hash table at root?] by Tim, [[CCC]], January 31, 2000 » [[Transposition Table]]
* [https://www.stmintz.com/ccc/index.php?id=95710 Question: Fail low at root and time management] by [[William Bryant]], [[CCC]], February 08, 2000 » [[Fail-Low]], [[Time Management]]
* [https://www.stmintz.com/ccc/index.php?id=144413 Root move and incomplete iteration] by [[Frank Phillips]], [[CCC]], December 11, 2000
: [https://www.stmintz.com/ccc/index.php?id=144432 Re: Root move and incomplete iteration] by [[Robert Hyatt]], [[CCC]], December 11, 2000
* [https://www.stmintz.com/ccc/index.php?id=153648 What means lazy/plain alpha bounding?] by [[Severi Salminen]], [[CCC]], February 06, 2001 » [[Fail-High]]
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6666 Even more search questions] by [[Sven Schüle]], [[Computer Chess Forums|Winboard Forum]], July 17, 2007 » [[Iterative Deepening]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=38404 Root node search] by [[Onno Garms]], [[CCC]], March 13, 2011 » [[Onno]]
* [http://www.talkchess.com/forum/viewtopic.php?t=39346 Root node search in Stockfish] by [[Onno Garms]], [[CCC]], June 12, 2011 » [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=42224 A few general questions...] by [[Bill Henry]], [[CCC]], January 29, 2012 » [[Exact Score]], [[Aspiration Windows]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50907 Pruning in PV nodes] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], January 14, 2014 » [[Reductions]], [[Node Types]]
* [http://www.talkchess.com/forum/viewtopic.php?t=54241 Solving a fail low situation at the root] by [[Alberto Sanjuan]], [[CCC]], November 03, 2014 » [[Aspiration Windows]], [[Fail-Low]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=58055 Ordering of Root moves and search instability !] by [[Mahmoud Uthman]], [[CCC]], October 26, 2015 » [[Move Ordering]], [[Search Instability]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61358 Root search] by [[Laurie Tunnicliffe]], [[CCC]], September 08, 2016
=External Links=
* [https://en.wikipedia.org/wiki/Root Root from Wikipedia]
* [https://en.wikipedia.org/wiki/Root_(disambiguation) Root (disambiguation) from Wikipedia]
* [[Videos#IanCarr|Ian Carr's]] [https://en.wikipedia.org/wiki/Nucleus_%28band%29 Nucleus] - [https://en.wikipedia.org/wiki/Ian_Carr#Nucleus Roots], 1973, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=crmCSnPxWAo|alignment=left|valignment=top}}
'''[[Node|Up one Level]]'''
The '''Root''' of the [[Search Tree]] is the initial [[Chess Position|position]] of the [[Search|search]]. Many programmers dedicate a separate function for doing a root search, since using a different [[Move Ordering|move ordering]] scheme may be beneficial. Also root search must return not only the value, but also the [[Best Move|move]] which will be played. This in turn may require special care in case of a fail-low when using [[Aspiration Windows|aspiration window]]. This is typically where the [[Time Management|time management]] decisions are beneficial.
=See also=
* [[Conspiracy Numbers]]
* [[Fail-Low]]
* [[Iterative Deepening]]
* [[Principal Variation#MultiPV|Multi-PV]]
* [[Oracle]]
* [[Piece-Square Tables#Preprocessing|Piece-Square Tables - Pre-processing]]
* [[Ronald de Man#ScoringRootMoves|Scoring Root Moves]] by [[Ronald de Man]]
* [[Time Management]]
=Forum Posts=
==1997 ...==
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 1, 1997
: [http://groups.google.com/group/rec.games.chess.computer/msg/0df39371422a600c Re: computer chess "oracle" ideas...] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], April 3, 1997
: [http://groups.google.com/group/rec.games.chess.computer/msg/ccc2546e26d92f88 Re: computer chess "oracle" ideas...] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], April 7, 1997
* [https://www.stmintz.com/ccc/index.php?id=23672 Failing low at the root] by [[Guido Schimmels]], [[CCC]], August 03, 1998
* [https://www.stmintz.com/ccc/index.php?id=84651 Question: Fail High then Low at Root] by [[William Bryant]], [[CCC]], December 28, 1999 » [[Fail-High]], [[Fail-Low]], [[Search Instability]]
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=93686 Can we use hash table at root?] by Tim, [[CCC]], January 31, 2000 » [[Transposition Table]]
* [https://www.stmintz.com/ccc/index.php?id=95710 Question: Fail low at root and time management] by [[William Bryant]], [[CCC]], February 08, 2000 » [[Fail-Low]], [[Time Management]]
* [https://www.stmintz.com/ccc/index.php?id=144413 Root move and incomplete iteration] by [[Frank Phillips]], [[CCC]], December 11, 2000
: [https://www.stmintz.com/ccc/index.php?id=144432 Re: Root move and incomplete iteration] by [[Robert Hyatt]], [[CCC]], December 11, 2000
* [https://www.stmintz.com/ccc/index.php?id=153648 What means lazy/plain alpha bounding?] by [[Severi Salminen]], [[CCC]], February 06, 2001 » [[Fail-High]]
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6666 Even more search questions] by [[Sven Schüle]], [[Computer Chess Forums|Winboard Forum]], July 17, 2007 » [[Iterative Deepening]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=38404 Root node search] by [[Onno Garms]], [[CCC]], March 13, 2011 » [[Onno]]
* [http://www.talkchess.com/forum/viewtopic.php?t=39346 Root node search in Stockfish] by [[Onno Garms]], [[CCC]], June 12, 2011 » [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=42224 A few general questions...] by [[Bill Henry]], [[CCC]], January 29, 2012 » [[Exact Score]], [[Aspiration Windows]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50907 Pruning in PV nodes] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], January 14, 2014 » [[Reductions]], [[Node Types]]
* [http://www.talkchess.com/forum/viewtopic.php?t=54241 Solving a fail low situation at the root] by [[Alberto Sanjuan]], [[CCC]], November 03, 2014 » [[Aspiration Windows]], [[Fail-Low]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=58055 Ordering of Root moves and search instability !] by [[Mahmoud Uthman]], [[CCC]], October 26, 2015 » [[Move Ordering]], [[Search Instability]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61358 Root search] by [[Laurie Tunnicliffe]], [[CCC]], September 08, 2016
=External Links=
* [https://en.wikipedia.org/wiki/Root Root from Wikipedia]
* [https://en.wikipedia.org/wiki/Root_(disambiguation) Root (disambiguation) from Wikipedia]
* [[Videos#IanCarr|Ian Carr's]] [https://en.wikipedia.org/wiki/Nucleus_%28band%29 Nucleus] - [https://en.wikipedia.org/wiki/Ian_Carr#Nucleus Roots], 1973, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=crmCSnPxWAo|alignment=left|valignment=top}}
'''[[Node|Up one Level]]'''
