Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Programmer challenge

Author: Robert Hyatt

Date: 21:21:39 02/20/03

Go up one level in this thread


On February 20, 2003 at 17:04:52, Filip Tvrzsky wrote:

>On February 20, 2003 at 11:26:18, Robert Hyatt wrote:
>
>>
>>One point.  After you try a few such moves, you can become pretty well convinced
>>that this is an ALL node where move ordering is irrelevant.  You ought to turn
>>it off
>>after N moves have not produced a cutoff.  N is something you have to come up
>>with
>>of course.  I do this with the History heuristic and I use N=4 myself, as I have
>>already tried
>>the hash move, good captures (SEE says gain >= 0) and killer moves.
>>
>
>So is there any sorting of moves necessary at all? If I can understand what you
>means, when hash move, killers and good captures etc. don't produce a cutoff,
>the task is only to select N=4 of most promising moves from remaining ones?
>Filip


That is what works for me.  Typically if I fail high, I fail high on the first
move tried 92% of the time.  The remaining moves provide those other 8% moves.



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.