Author: Dieter Buerssner
Date: 10:11:49 08/20/03
Go up one level in this thread
On August 20, 2003 at 13:05:17, Christophe Theron wrote: >In any case I cannot imagine that restoring the hash key for the current >position from memory could be slower than computing it again by undoing a >sequence of XORs (at least 2) on a 64 bits integer... ... and while doing this, accessing memory anyway. Typically at least 2 64 bit values for a normal move, unless one has a very big table with precalculated xored values of from/to pairs. Regards, Dieter
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.