Author: Gian-Carlo Pascutto
Date: 08:47:54 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. All else being equal, I prefer the fastest tool for the job, especially if it doesn't need assembly. The speed of a routine like this can also influence other parts of the engines design. -- GCP
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.