Author: Robert Hyatt
Date: 10:18:37 07/29/05
Go up one level in this thread
On July 29, 2005 at 09:44:26, Madhavan wrote: >On July 29, 2005 at 07:30:04, Ed Schröder wrote: > >>On July 29, 2005 at 05:48:51, William Sorin wrote: >> >>>What's the main candidates? Fritz vs Junior match of 2003? >> >>The best 10 comp-comp games are invisible, nobody ever saw them, they are hidden >>in large databases of engine-engine tournaments which games are never seen nor >>replayed, nor analysed. >> >>Ed > >Computer Chess tournaments he meant,not engine-engine matches reported by >testers.testers don't go through games,they are only interested in results and >engine ranking,nothing else. > >an you post the game that either side as no errors and is perfectly played? > >"Who could evaluate such a game and prove that its perfectly played until chess >is solved"-Dr.Robert Hyat > >great one,Bob > >:) > >Bob,Do you still say chess can be solved? can be? Yes. Trivial to prove. will be? No. Too much computation required.
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.