Author: Robert Hyatt
Date: 07:12:46 01/24/03
Go up one level in this thread
On January 24, 2003 at 08:27:02, Albert Bertilsson wrote: >Hello! > >I've heard much about 0x88 board and the basic idéa is that all moves can be >determined to be on board or not with the AND 0x88 operation. This seems rather >nice, but the cost is that all mappings to lookuptables that was indexed 0-63 >needs to be 0-127 instead (otherwise the square number needs to be converted >down to 0-63 range (which is not for free). So basically all tables that was >0-63 now are 0-127 a factor two in size, and for tables indexed with from and >to, size is multipled by 4. > >Is it worth using 0x88 boards? The added size of all tables will decrease the >chance of cache-hits. > >/Regards Albert Bertilsson Not really. If you use bytes, for example, 128 bytes is the typical cache line size for a PIV (L2). So a reference to the chess board is going to suck in 128 bytes anyway, so the "cost" is minimal.
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.