Author: Heiner Marxen
Date: 10:05:01 01/03/01
Go up one level in this thread
On January 03, 2001 at 11:38:50, Uri Blass wrote: >On January 03, 2001 at 10:23:52, Paul Petersson wrote: > >>On January 02, 2001 at 23:16:45, Uri Blass wrote: >> >>>On January 01, 2001 at 18:36:57, Olaf Jenkner wrote: >>> >>>>Gustav finds the mate in a few minutes. It is not a difficult position >>>>for problem-solvers, because the black king has no more then one flight. >>>> >>>>Olaf >>> >>>What is Gustav? >>> >> >>Look here: > > > >> >> http://dmoz.org/Games/Board_Games/C/Chess/Software/Chess_Problem_Software/ > >Thanks > >There are surprising programs at this site. > >One of them (notch) construct a game based on a position >and the programmer even provides a source code. Correct spelling is "natch". >I am interested to know what is the algorithm that is used >to compose a game for a chess position. > >It is possible to look at the source code but >I understood that the comments are not in english so >I prefer to read a reply here. >Uri I have had a rather quick look through the sources. Comments and identifiers are mixed english/french ;-( Natch appears to use a rather clever distance measure (how far away (backwards) is this position from the start position?). It looks quite similar to the methods which Popeye uses to speed up the solution of help mates. May be the authors of Natch and Popeye have a common subset (or know each others work). The method is really quite clever. Sometime in the future I will try to work out a suitable clone for Chest to speed up the helpmate search. Heiner
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.