Author: Reinhard Scharnagl
Date: 05:12:39 10/22/04
Go up one level in this thread
On October 22, 2004 at 07:14:49, Thorsten Greiner wrote: >...For non-sliding pieces, attack_to is constant. For sliding pieces, attack_to can >be efficiently calculated using rotated bitboards. Actually, that is the whole >point of rotated bitboards (at least most of it). If that would be true, what time does an average request of being attacked cost? I am (still) quite sufficient with my results, always computed on demand, and not at all using bitboards. Some actual testing results (P4, 2.8 GHz) at: [http://www.chessbox.de/Down/CRC_Test_01.txt]. Regards, Reinhard.
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.