Computer Chess Club Archives




Subject: Re: Move ordering?

Author: Robert Hyatt

Date: 19:01:00 04/29/00

Go up one level in this thread

On April 29, 2000 at 16:09:42, Tom Kerrigan wrote:

>On April 29, 2000 at 11:47:58, William Bryant wrote:
>>On April 29, 2000 at 05:21:10, Colin Frayn wrote:
>>>>You could also use the node counts for each move at the root to
>>>>reorder your moves after each iteration.
>>>Good plan.  I read somewhere that Crafty does that (I think) so I'll have a go.
>>>I have that info already so it wouldn't be hard to shove it into the move
>>Bob gets all the credit here.  In answering my same question about 3 months
>>ago, he suggested using the node counts.  More nodes, longer searching,
>>potentially more important move.
>I wouldn't give Bob all the credit. Many people have been using this idea for
>many, many years.

I would probably give the credit to Harry Nelson.  He suggested this in 1978
because of his fetish for solving chess problems, and this tends to push the
'almost solution' to the top part of the move list.  I've used it ever since...
I didn't hear of it prior to that, but I have told many about it since that

This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

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