Author: Thom Perry
Date: 05:55:35 11/18/98
Go up one level in this thread
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. >Really, the possibilities are endless -- limited only by the imagination of >those who wish to use the end product for research. > >For more information, by all means, read the C.A.P. FAQ. >ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.htm >It also comes in Word97 document format: >ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.doc >And rich text format: >ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.rtf
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.