Author: Frank Phillips
Date: 13:15:03 01/14/99
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 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.