Author: Russell Reagan
Date: 06:32:16 12/03/02
Go up one level in this thread
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.
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.