Author: Vincent Lejeune
Date: 11:12:18 09/18/02
Go up one level in this thread
On September 18, 2002 at 13:56:21, Heiner Marxen wrote: >On September 18, 2002 at 13:17:26, F. Huber wrote: > >>On September 18, 2002 at 01:12:15, Jouni Uski wrote: >> >>>I have tested UCI version and found, that program is unbelievable fast. I have >>>tested some EGTB positions to verify solution with Nalimov's! And they were >>>same. >>>But one question: is it possible to see any info about search depth and/or node >>>speed? Or should I only wait may be hours before anything is displayed? >>> >>>Jouni >> >>Hi Jouni, >> >>that´s really one problem, I´m also not very happy about with my ChestUCI. >>But the original ´Chest´ does NOT output ANY informations while thinking, >>and so also my UCI-interface has absolutely no chance to inform the GUI about >>the progress of the searching :-( >> >>If you really have no idea of ´how many moves to mate´, maybe it could help >>to start with a moderate number of ´SearchDepth´ (e.g. 5, 6,...) and increase >>this number by one whenever no mate has been found. So you could at least >>get ´some´ idea, how long the next calculation step would need. >> >>Maybe in the next version Heiner Marxen will implement ´some´ output info >>while thinking - at least the actual search depth would IMO not slow down >>the reallly fantastic seach speed. > >I'm listening... "I'll do my very best". > >Unfortunately, the next version of Chest is delayed, but there is some chance, >that I offer a slightly extended version 3.19b, better suitable for ChestUCI. >I would announce that here, of course. > >Cheers, >Heiner It would be great if you can make a .pgn file output with variations and sub-variations ! Thanks for your marvelous mate solver ! ;o)
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.