Author: Dann Corbit
Date: 11:28:24 06/11/02
Go up one level in this thread
On June 11, 2002 at 06:20:38, Gian-Carlo Pascutto wrote: >On June 10, 2002 at 18:49:17, Dann Corbit wrote: > >>On June 10, 2002 at 17:21:32, Peter Fendrich wrote: >> >>>On June 10, 2002 at 15:47:14, Dann Corbit wrote: >>> >>>Dann, >>>why do you collect these rotating functions? >>>When it comes to me I don't make any rotating during search just during the >>>initial phase when the program starts. >>>During search it is lookups in order to get the rotated file or diagonal. >> >>Suppose that you wanted to switch from 0x88 to bitboard, and all that you >>maintained was a single, non-rotated bitboard when in 0x88 mode? > >You still need to find a way to get the R45 and L45 bitboards though. 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.
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.