Author: Robert Hyatt
Date: 17:58:40 10/14/99
Go up one level in this thread
On October 14, 1999 at 18:35:08, Shaun Brewer wrote: >On October 14, 1999 at 09:55:27, Robert Hyatt wrote: > >>On October 14, 1999 at 08:04:43, Georg v. Zimmermann wrote: >> >>>Also make sure to search at least +2ply more if you got the right move, or else >>>it could be just luck. >>> >>>--Tec >> >> >>all the searches were for 10 minutes. the 'log eater' then finds the _last_ >>time it changes to the solution move. Of course if it changes the last >>iteration, there is no way to go two more plies deeper... > >Bob is there any chance you could make your 'log eater' public or if it already >is point me in the correct direction. I have been running crafty versions though >the test suites you e-mailed me a few weeks back at multiple time controls >rather than write a program to parse the output but if there is a 'log eater' >available! > >Thanks in advance > >Shaun You can certainly have it. the problem is that it has a small main program that loops and calls a function that finds a complete problem from the key move thru the last iteration and returns the correct time it found the solution. I copy this into an array. From there you will have to modify it to handle the number of test positions you feed it. Small piece of C code that I use to produce things like the wac crosstable. email me and I'll send it to you or anyone interested, but 'caveat emptor'.. it was written quickly and without any real emphasis on readability...
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.