Author: Gerd Isenberg
Date: 07:50:32 12/03/02
Go up one level in this thread
On December 03, 2002 at 09:32:16, Russell Reagan wrote: >On December 03, 2002 at 06:40:36, Gian-Carlo Pascutto wrote: > >>Does this mean that this is the fastest currently known >>FindFirstAndRemove *and* that it doesn't need assembly? >> >>Impressive for sure! > >I wonder how much of an increase in playing strength you are going to get from >gaining an extra 0.36 to 0.73 seconds every billion times you call this. I'm >betting it's almost nil. Hi Russell, It depends how often you traverse bitboards in this way. Currently i do it very often - and there is a considerable impact. As i mentioned before, i'll try to eliminate such loops in the future at all, eg. using multiple piece floodfill - or if i traverse, only isolating the LSB via (b & -b) and doing some clever mapping later, if needed. Of course you are right, that there are more important issues influencing the playing strength, but it's even fun and increasing awareness. I'm still in an advisement process, with hammer in mind. Cheers, 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.