Author: Harald Lüßen
Date: 16:03:25 07/31/04
Go up one level in this thread
On July 30, 2004 at 10:14:51, Ed Schröder wrote: > if (from[depth+0]==to[depth-2] && to[depth+0]==from[depth-2] > && from[depth-1]==to[depth-3] && to[depth-1]==from[depth-3]) -> draw > >I have used this in my 6502 days in QS only and it worked like a charm. >Regarding speed (IMO) nothing can beat this because in 90% of all cases the >first compare will fail, so actually you are doing just one compare in 90% of >all QS cases. Is this the only repetition check in qsearch or just the first one? Harald
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.