Root

From Chessprogramming wiki
Jump to: navigation, search

Home * Search * Node * Root

The Root of the Search Tree is the initial position of the search. Many programmers dedicate a separate function for doing a root search, since using a different move ordering scheme may be beneficial. Also root search must return not only the value, but also the move which will be played. This in turn may require special care in case of a fail-low when using aspiration window. This is typically where the time management decisions are beneficial.

See also

Forum Posts

1997 ...

Re: computer chess "oracle" ideas... by Ronald de Man, rgcc, April 3, 1997
Re: computer chess "oracle" ideas... by Ronald de Man, rgcc, April 7, 1997

2000 ...

Re: Root move and incomplete iteration by Robert Hyatt, CCC, December 11, 2000

2005 ...

2010 ...

2015 ...

External Links

Up one Level