Author: David Dahlem
Date: 12:10:56 09/02/02
Go up one level in this thread
On September 02, 2002 at 13:42:51, John Merlino wrote: >On September 02, 2002 at 13:15:28, David Dahlem wrote: > >>On September 02, 2002 at 12:58:30, John Merlino wrote: >> >>>On September 02, 2002 at 12:53:51, David Dahlem wrote: >>> >>>>Regarding the "Solve for Mate" feature of CM 8000, is there any way to save the >>>>solution and/or solution time to a logfile? How does one know the time it takes >>>>for a mate to be solved? >>>>This question will also apply to CM 9000, whenever it is available for purchase >>>>in my local retail stores. >>>>Thanks >>>>Dave >>> >>>With CM8000, I am not sure if you can do this. You can try opening the Thinking >>>Lines window and checking the Chessmaster checkbox. That might show you the >>>thinking output of the mentor engine as it tries to solve the mate. >>> >>>In CM9000, you just need to open the Mentor Lines window and watch the analysis >>>of the Solve for Mate feature. >>> >>>Note, however, that most mates are solved faster by the standard search, rather >>>than the Solve for Mate search. >>> >>>jm >> >>Thanks John. I tried opening the thinking lines window, but it appears that, >>since time control is infinite, that the engine keeps thinking and updating the >>times. So i can't figure out the solution time. >>I will experiment with standard search, is it more or less accurate than the >>Solve for Mate? >>Regards >>Dave > >It is neither more nor less accurate; it is merely a different kind of search. >You will notice that, when using the Solve for Mate search, the depth is >displayed as X/X, instead of X/Y. Basically, for the Solve for Mate search, no >extensions are used. This is why, typically, the standard search is faster at >finding mates. > >jm Using the standard search, Chessmaster will find mates, but not necessarily the shortest mate. There is no way to tell if it found the shortest mate, since if you give it more time, it might find a shorter mate. So i don't consider this the ideal way to search for mates. Any engine can find "a" mate using analyze , but not necessarily solving for shortest mate. Only a special mate solving engine can do that. Regards Dave
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.