Author: Georg v. Zimmermann
Date: 09:27:51 05/25/02
Go up one level in this thread
>The problems are far greater. > >Please try to generate in bitboards mobility with for a bishop >at each square a value in array > > bishopvalues[64]; > >That's 3 times slower in bitboards than it is in nonbitboards. > >Now let's try to get the NUMBER of attackers at a square. > >In DIEP this is: > > numberofattackers = Attacks[side][sq] & 15; > >In bitboards as crafty uses them you can't even write such >general code! I keep track of attacks to each square incrementally which slows me down by a factor of 2 overall. Georg
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.