Author: martin fierz
Date: 11:59:30 09/25/04
Go up one level in this thread
On September 25, 2004 at 13:16:11, Zach Wegner wrote: >On September 25, 2004 at 06:21:13, martin fierz wrote: > >>1) does anybody here have an idea how these 3 ways of generating attacks for >>sliders compare speedwise for both 32-bit and 64-bit processors? (reason: if >>kogge-stone will be comparable to rotated bitboards, i'd rather not bother to >>implement rotated bitboards, and if both are not much better than my current >>code, i'd also rather not bother with a rewrite). >> > >On 32 bit processors (using only 32 bit instructions, no MMX) rotated should be >a little faster. On 64 bits, I'm not so sure but the gap should narrow (or >kogge-stone might be faster). Both of these are probably a lot faster than your >method. > the funny thing is that my method seems to be faster than kogge-stone if my benchmarks are not all wrong... i don't understand it really... cheers martin
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.