Author: Vladimir Medvedev
Date: 06:48:00 10/17/03
Go up one level in this thread
Thank you, Gerd! >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 ;-) Can't compiler optimize it to log2(64) = 6 "if-then=elses" ? If not, I can do it manually... But I don't want to use assembler, it's not my native language... Could you write some direct links to threads on LSB topic in this Forum? This search engine does not work for me :(((
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.