Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 14:19:17 01/25/02

Go up one level in this thread


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.

However, since chess ELO figures are integral values, his ELO will still be
zero, on average.



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.