Author: Dan Newman
Date: 00:55:15 02/03/01
Go up one level in this thread
On February 02, 2001 at 03:30:54, Dann Corbit wrote: >On February 02, 2001 at 03:11:08, Dan Newman wrote: >[snip] >>You guys are beginning to convince me I need to try this out again. It >>seems everyone that has tried both has found rotated to be faster. The >>last time I visited rotated bitboards, though, they really put my brain >>in a twist. Retrofitting this will take me a lot longer than 6 hours >>though... > >Have you read James Swafford's explanation? >http://members.nbci.com/jswaff/chessprg/rotated.htm Yes. Very nice web pages. I've even downloaded them at some point :). I do actually understand how they are generally implemented; it's just fiddling with all those little details and also modifying my code that gets in the way. The main thing will be adding the rotated bitboard updates to make()/undo() which runs to about 1300 lines of code in Shrike (each different move type getting its own section in a large switch statement). -Dan.
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.