Author: Gerd Isenberg
Date: 06:39:29 10/17/03
Go up one level in this thread
On October 17, 2003 at 06:40:38, Vladimir Medvedev wrote: >Just a pre-release. >Source code only. >Build with GCC. > >http://www.geocities.com/win_pooh_ru/chess/greko.html >http://bearlodge.webservis.ru/chess/greko.html Thanks Vladimir, i had a quick look to your Bitboards.cpp file. My collection of BitScan (LSB) routines exceeds further on. I fear your switch case with single isolated LS1B is not optimizable as a jump table, but works like 64 nested "if then elses". Not sure about how the branch prediction works here, but i guess the squares on the "black" side are a bit handicapped ;-) I suggest a lookup-approach (similar to your popcount), Walter Faxon's genius folding trick, Matt Taylor's de Bruijn approach or several assembler routines using 32-bit bsf, all already posted here in CCC x times. Regards, Gerd
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.