Author: Dann Corbit
Date: 12:14:50 11/18/98
Go up one level in this thread
On November 18, 1998 at 08:55:35, Thom Perry wrote: >On November 17, 1998 at 22:59:05, Dann Corbit wrote: >>A. How many games were resigned from a clearly winning position? >>B. How many openings from the ECO classification have one side down by at least >>three pawns when the formation is fully developed? >>C. What percentage of great moves were simply never seen, even by intense >>computer analysis using a variety of programs? >>D. What kind of positions are the most difficult for computers to properly >>solve? >>E. What kind of positions are much harder for humans to solve than computers? >> > >Who cares? At best, some of this information may be interesting, but >useful? Knowing how many games were resigned from a clearly winning >position is going to help me in an OTB or computer chess game? Not >hardly. Same for the rest. Perhaps a clever person such as yourself can figure out more salient queries that will have value for you. If nothing else, it may make your favorite chess program play slightly better during the openings. Those were simply examples that are interesting to *me*. Your interest may be along completely different lines. At any rate, to the best of my knowlege, a study of this nature has never even been attempted. We can't really know what we will find out until we give it a go. Of course, no one is going to put a gun to your head and make you participate. It's voluntary.
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.