Author: Robert Hyatt
Date: 19:41:28 01/14/99
Go up one level in this thread
On January 14, 1999 at 16:15:03, Frank Phillips wrote: >I have been following Bruce?s 0x88 class with interest. My program is based on >TSCP?s integer array and mailbox[] approach to representing the board and >testing whether a square is off the board. Of the various approaches (0x88, >mailbox, gnuchess, and bitboard) which is inherently faster and by how much. I >realise the true answer probably depends on whether a program utilises the >advantages of a particular approach but am simply interested in whether there is >a big difference and their relative ranking. This is difficult to answer. 0X88 is the easiest way to test for 'edge of board' conditions. But bitboards don't even test, because they work differently. But they have some inefficiencies on many platforms at present. The answer is all of the above... or none of the above.. or some of the above.. sorry... :)
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.