Computer Chess Club Archives

Search

Messages

Subject: Re: Unsuccessful experiments in move ordering

Author: Dann Corbit

Date: 01:01:36 12/14/00

Go up one level in this thread

I have seen this used successfully:

Order the moves by the time of the last search.  For ply one (which is
instantaneous) just use generated order.  Then for each subsequent ply, first,
analyse the current pm, then the one that took longest to analyze after that.
Then the next longest.  The one that was fastest should be analyzed last.

It seems to work very well in practice.  And it is absurdly simple.

• Re: Unsuccessful experiments in move ordering Robert Hyatt 06:28:02 12/14/00
  • Re: Unsuccessful experiments in move ordering José de Jesús García Ruvalcaba 06:58:51 12/14/00
    • Re: Unsuccessful experiments in move ordering Robert Hyatt 11:19:26 12/14/00
• Re: Unsuccessful experiments in move ordering David Rasmussen 01:55:25 12/14/00

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.