Author: Sven Reichard
Date: 01:01:41 06/21/02
Go up one level in this thread
Maybe I'm missing something here, but if you furthermore agree to use a hash table of size 2^i, i <= 32, you can replace all mods, divs and muls by a 32 bit 'and'. The performance hit of the slightly smaller table (less than factor 2) should be outweighed by the faster access. just my 2 bits Sven.
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.