Author: leonid
Date: 17:59:21 10/07/99
Go up one level in this thread
On October 07, 1999 at 18:29:23, Heiner Marxen wrote: >On October 07, 1999 at 17:57:55, leonid wrote: > >[snip] >>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 take it, that you say "logic", when I would say "search". > >>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. > >Yes, I will announce it here. > >>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. > >The main application for a stand alone mate solver is chess problems. >Therefore CHEST also knows about e.g. selfmate and helpstalemate. >Of course, a mate solver can help to independantly verify any mate result. > >Heiner Could be very interesting to go and see your page if you have there some description (general) about all your logic. Would like to read how you started and all your stages. If you have some code with description it will be even more exciting. Please, give your address here, if already you have something of what I mentioned. If you can say in advance what you have on your page will be also welcomed. Thanks, 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.