Author: Dann Corbit
Date: 13:00:05 04/27/01
Go up one level in this thread
On April 27, 2001 at 11:45:42, Bas Hamstra wrote: >Dann, > >Your posted version was slightly slower than mine. For 32 bits it is faster, but >not for 64 bits, because the needed 64 bits shifts cause extra overhead. So, so >far I have not found a faster version than my simple table lookup. Tricks to sum >up 2 32 bit counts are about as fast as my original. I think it is more or less >the limit for ui64. I checked out all your routines, for 32 bits my version can >be much improved upon, but so to see not for 64 bits. > >(I used Borland to compare) Check again if you change compilers. I find that what is fastest changes from compiler to compiler.
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.