Author: José Antônio Fabiano Mendes
Date: 09:53:54 05/08/02
http://www.talkchess.com/forums/1/post.html
(A few words on "computer discovery" may not be out of place. Provided that the
programmer has access to a sufficiently powerful machine, the construction of a
definitive table of results for any particular combination of material is
straightforward, and all that is then necessary is to search it for interesting
positions. Even this can be largely done by computer, for example by
calling for the longest win, for the positions of reciprocal zugzwang, and for
any positions where a player has a significantly shorter win if it is his
opponent’s move. But while the work involved is vastly less than in conventional
composition, not least because the "composer" does not spend time analysing
positions which eventually prove to be unsound, it does not follow that
the positions that result are less interesting. Paul Byway wrote in Variant
Chess about the two positions in the next item: "These discoveries, dredged from
the sea of possible positions, have a gem-like quality that seems to be missing
from most of our more laboured, human constructions.") <=== John Beasley
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.