Author: Russell Reagan
Date: 15:57:06 01/21/03
Go up one level in this thread
On January 21, 2003 at 14:37:10, Bas Hamstra wrote: >I doubt it too, although the rotated BB lookup tables are relatively big, and >may suffer from cache misses, which are expensive. I wonder how much speed you would gain if you could somehow use smaller tables (say a few KB) instead of the amount that Crafty uses, which is around half a MB. Significant speedup or not? >Also I am not sure you >couldn't use multiple slider attackmasks for move generation. Suppose you want >to generate captures. Generate a combined attackmask UP for all white queens and >rooks. AND that mask with all black pieces and you have the TO squares, which >will be few (if any). Now you can figure out the FROM squares, by simply >scanning the board down from each individual TO square (requires looping), or by >taking the attacked-piece mask, and filling it down until it hits white pieces. >Or by masking white pieces per file the attacked piece is on, and FirstOne will >give the attacker. This would be quite a bit faster than doing the BlockedFill >for each piece seperately. Could be competitive, no idea. Interesting, but I fear that it will either be slow looping or you run into complications. For example, if you have a rook on b1 and also on b4, and a black bishop on b7, and you used the "AND with file" method you described, then you could have problems since both rooks would show up. It's still interesting to think about.
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.