Author: James Robertson
Date: 22:19:08 04/06/99
Go up one level in this thread
On April 07, 1999 at 00:56:06, Bruce Moreland wrote: > >On April 06, 1999 at 20:11:38, James Robertson wrote: > >>On April 06, 1999 at 17:43:44, Bruce Moreland wrote: > >>>Another idea, which may very well be bad, would be to ignore the whole problem >>>and simply search some moves twice. > >>Yeah; I tried this and it was terrible. Because the first move chosen was >>usually close to the best, it would take a while to cut it off.... > >I have never tried it since I don't use an incremental move generator. However, >wouldn't the duplicate move cut off instantly via the hash table? > >bruce To answer you both: I don't have a hash table. :o James
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.