Author: Russell Reagan
Date: 12:52:18 04/07/03
Go up one level in this thread
You could use a lookup table for both of the things you want to do, and both should be exceptionally fast. You could use 16-bit tables, or 8-bit tables with a tiny amount of logic, and the 8-bit might run faster due to cache friendliness. You'd just have to try and see which gives the best results.
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.