Author: Bob Durrett
Date: 19:27:07 12/02/02
Intuitively, is seems that it should be possible to write a program to do the following: (1) Examine a given position to generate good "fantasy positions" based, perhaps, on use of a pattern recognition scheme. A library of relevant patterns might be called up out of memory and then a "very smart" subprogram would synthesize candidate fantasy positions. This synthesis might utilize a routine to maximize the position evaluation score, where placement of the available pieces is treated as a variable. (2) Analysis to find possible legal move sequences leading from the "given position" to the currently considered "fantasy position." Legal move sequences would be an output. (3) Conventional search engine analyses whose purpose would be to determine whether or not any of the legal move sequences would be playable. The main purpose would be to rule out legal move sequences which would not likely occur. This would happen if the intermediate positions had "best moves" which were different from the moves in that sequence. Maybe some of this could be done more or less concurrently and/or interactively. Admittedly, this is a "half-baked" idea. It seriously needs refinement. Could any of the programmers here at ICD CCC produce such a program if they wanted to? Bob D.
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.