Author: leonid
Date: 14:57:55 10/07/99
Go up one level in this thread
On October 07, 1999 at 13:11:10, Dann Corbit wrote: >On October 06, 1999 at 21:19:53, leonid wrote: >[snip] >>This is just after visiting your place that I deposed this message. Why you >>don't have your E-mail there to contact you when somebody have a question? >It's in the C.A.P. FAQ > >>What I found there is that many position were indicated as verified for mate in >>6 moves but had the mate as such only in 2 moves. This is too short time for me >>(if I understood correctly what was said there) to know the speed of the game. >>And did you your trying at fixed depth and by brute force search? >These problems were not solved by a checkmate solving program (Altough they are >going to be reanalyzed with Heiner Marxen's CHEST program once he has completed >the EPD interface). Therefore, you should consider none of them as minimum >mates but only certain mates. Only mate found at minimum number of moves can say about the speed of the game. Some game can have very efficent quick logic but slow basic logic. This is true for logic that solve mate and for every other logic. I read few times about the game that solve only the mate but was not sure if even some interest existe in this field. I hope that when interface of Maxen's Chest program will be ready, he will come in this place to announce this. At least for me it will be very curious to go and to see its work. Actually my logic is composed from two parts, one do nothing beyond the solving of the mate and the next do everything else. But I never expected that there are some direct application for stand alone program as mate solver. Leonid.
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.