Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Root move ordering

Author: Robert Hyatt

Date: 20:39:16 09/26/04

Go up one level in this thread


On September 26, 2004 at 00:39:43, Sergei S. Markoff wrote:

>How much root move ordering based on nodes count for each move improves playing
>strength? Does anyone have results on it?
>
>I was in thought about this method of root moves ordering and was disguisted
>when discovered that Dr.Hyatt invented it before me :))


Note that I didn't invent this.  Harry Nelson (cray blitz team member) did so
around 1984 or so when he noticed the parallel search issue of a move near the
end of the move list becoming best on the next iteration, if there was time.  He
was a big "problem solver" rather than a "chess game player" and was looking for
things that would help solve problems quicker.  This idea also applied well to
real games also so we adopted it and I continued to do so in Crafty...

But it was 100% Harry Nelson...




This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.