Computer Chess Club Archives




Subject: Re: Move ordering - How do I know if I have played this move already?

Author: Dave Gomboc

Date: 07:15:44 04/07/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?

I was actually writing a post with the same comment, but then it occured to me
that this would be done everywhere, not just at the root, and when the hash
table overflowed, the performance would drop like a stone.  I'm not sure at what
length of thinking time this would occur, I haven't written a chess program, so
I figured I'd best leave it alone.  James has now said he doesn't have one at
all, so it's easy to see why it didn't work for him.

James, get a hash table! :-)  They make a big difference.

Dave Gomboc

This page took 0.01 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.