Author: Russell Reagan
Date: 07:58:20 04/23/02
Go up one level in this thread
On April 23, 2002 at 07:30:12, Uri Blass wrote:
>It is not more complicated and it is faster to do the following:
>
>genallmove();
>while (move left)
>{
>sortnextmove();
>makeMove();
>search...
>}
>
>Uri
How does this work? I don't understand what you mean by sorting a single move.
If you could explain a little more how this works I would appreciate it.
Russell
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.