Author: Ren Wu
Date: 17:28:34 11/20/01
Go up one level in this thread
On November 20, 2001 at 20:06:34, Dann Corbit wrote: >Since you can do the same sort of move generation with bitboards, what is the >advantage of using Move Tables then? For move generation only, i think this can be faster. (i never tried bitboard approach myself, so this is just a guess) This approach has been discovered long before rotated bitmap, i was extremely impressed when i first saw it in gnu chess in 1992. Even now, i have high respect to guy who come up this idea. Sorry i forgot his name. >Is it extremely easy to understand and debug? Yes, the code is much simpler, very pretty in my opinion. There is a small txt file that come with gnu chess 3.0 by the orignal person who come up with this idea. of course you can take a look at the code itself too. This approach make more sense when back in old 286/386 days. For current hardware, relay on memory tables seems not a good idea anymore. Ren.
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.