Author: Gian-Carlo Pascutto
Date: 12:27:27 06/11/02
Go up one level in this thread
On June 11, 2002 at 14:28:24, Dann Corbit wrote: >True enough. But I have a notion for that which I have not tried yet. The >table of bytes idea works for those. You just grab the 8 bytes from the >original bitboard and by a table lookup, put them in the target slot in a single >operation. I am also going to try a union with unsigned char to see if it is >faster than shifting. If you figure out the fastest method on x86 for each rotation (and the reversed bitboard), can you send me a mail? -- GCP
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.