Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Some Philosophical questions on the limits of Computer chess

Author: ALI MIRAFZALI

Date: 14:31:21 01/25/02

Go up one level in this thread


On January 25, 2002 at 17:25:56, Albert Silver wrote:

>On January 25, 2002 at 17:19:17, Dann Corbit wrote:
>
>>On January 25, 2002 at 17:07:59, Uri Blass wrote:
>>[snip]
>>>Even the player who play random moves is going to get more than 0% against the
>>>perfect player if you play enough games.
>>
>>I don't think this is a known result, but the one possibility that it might come
>>true is if there are an infinite number of games played, the imperfect player
>>could accidentally play a perfect game as white and win a point, or play nearly
>>perfectly and obtain a draw.
>
>I don't think that's necessary, unless by playing nearly perfectly you just mean
>avoiding losing moves. The way you put it, it sounds as if there are very few
>non-losing moves (i.e. a narrow road to avoid losing against perfect play)
>whereas I believe there are many many roads to a draw that even perfect play
>from the other side would not easily avoid.
>
>                                     Albert
>
>>
>>However, since chess ELO figures are integral values, his ELO will still be
>>zero, on average.
Yes indeed there are many roads to a draw.



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.