Author: Madhavan
Date: 05:17:27 01/18/05
>>i deny that,strongest program running on a faster hardware should not get a draw >>or lose in many games against super grandmasters,if it does then it is >>considered as not solved > >Solution of chess only means that the solver will never lose a match. >It does not mean not getting a draw or a loss. then consider there are 5 grandmasters and 1 program playing in the tournament that program is said to be "chess solvable",it does not lose to any of the grandmasters but drew with 2 grandmaster one of the grandmaster drew the machine but won all the game against other grandmasters,then that grandmaster will be declared as event winner,but loses few game in another event then what is your point? >> >>>Who can post a perfect game? Who could evaluate such a game and prove it is >>>perfect, until chess is solved... > >I believe that the following game is perfect game > >1.Na3 Na6 2.Nb1 Nb8 3.Na3 Na6 4.Nb1 Nb8 with draw by repetition. > >I believe that the initial position is a draw and this short game has no moves >that change the result. there are dozens of games in database,why dont you just pick up one of the super grandmaster game which was ended in draw and claim that the game was perfectly played,you wont?why? because there will be always an argument,detecting errors in the game like that "chess solvable" machine which was undefeated but drew some super grandmasters will be evaluated and that would lead to argument,like grandmaster claiming the program was too weak in blitz game what is your point?
This page took 0.01 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.