Author: Tord Romstad
Date: 06:10:59 05/06/04
Go up one level in this thread
On May 06, 2004 at 07:17:51, Vasik Rajlich wrote: >Aside from 32 vs 64 bits, L2 cache is probably very important. Rybka's >precomputed bitboard masks take just under 200 K (this # should be more or less >the same for any rotated bitboard engine), but I don't know how this behaves in >the cache. It is possible to bring the size of the precomputed bitmap data for rotated bitboards down to around 20 K (and perhaps even further). You would need one or two extra levels of lookup or calculations, though, and it is not at all clear that it would result in a faster program. Tord
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.