Author: Don Beal
Date: 09:38:56 10/31/98
Go up one level in this thread
On October 28, 1998 at 08:50:32, Mike Stoker wrote: >On October 27, 1998 at 13:19:07, Don Beal wrote: >>On October 27, 1998 at 06:04:02, Mike Stoker wrote: >>>As a challenge to all chess programmers, it would be interesting to see if >>>anyone can derive the rules required to promote a pawn without it being >>>captured, based solely on a knowledge of the legal game moves. This one >>>of the most simplistic chess positions, but obviously not a trivial task. >>>However, if we can accomplish this, I believe it will be a giant leap >>>forward in the quest for more intelligent computer programs. >> >>I agree with the statement about difficulty of doing this kind of thing >>in general. It is very worthwhile but gets rapidly harder if you try >>to go beyond pushing a single passed pawn. >>In fact the particular challenge you propose was already accomplished >>in 1977. And you are right - it is not trivial. >>It would be a considerable challenge to extend it to multiple pawns. >>If anyone would like to try this, I suggest looking at: >>"The construction of economical and correct algorithms for KPK" >>In: Advances in Computer Chess 2, Ed M.R.B.Clarke, EUP, 1980. >> >>Don Beal > >Hi Don, >I am very interested in getting hold of the paper you recommend - do you >know if there is an on-line version anywhere? No on-line version, sorry (long before this new-fangled web business! :-)). If you don't succeed in getting a copy from libraries, or someone you know, etc, I could make a photo-copy. Don Beal.
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.