Computer Chess Club Archives




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

Author: Bruce Moreland

Date: 21:48:35 04/08/99

Go up one level in this thread

On April 08, 1999 at 23:06:11, Christophe Theron wrote:

>This reminds me of a friend of mine (french he has now moved to Canada), who
>wanted to write a chess program. He began with move generation, and wrote a
>program that generated a (huge) source assembly code. In this generated code,
>for each piece on every possible square there was a routine you could call. This
>routine would generate in a blink all the possible moves of that piece!
>May be the fastest move generator you can dream of on a PC...
>But maybe not very useful because of the frequent cutoffs you get with simple
>hash move, captures and killers.
>The guy has stopped working on his chess program unfortunately...

This is the thing about move generators.  It's the first thing that everyone
does, and they go nuts on them.

I think that it's most important that they don't have bugs, don't go too
incredibly godawful slow, and fits in well with the rest of the program.

By the way, I wonder how fast your friend's thing really was?  It may have been
so big it blew cache.  The 0x88 system is a tiny bit of code with a few little
data tables, it might actually go faster, I don't know.


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.