Author: blass uri
Date: 13:34:33 06/15/99
Go up one level in this thread
On June 15, 1999 at 14:56:42, Christoph Fieberg wrote: >Thanks a lot for all the interesting and fascinating postings and discussions on >the topic. > >Here is a new thought from the newsgroup "rec.games.chess.computer". I quote >Michel Grimminck: > >------------------ >One way to compute this is, is to asses how well Kasparov would play >against a perfect computer. > >How many points would Kasparov score? Well in order to score even >he would have to play each of his moves flawless. If the 'average' >chance >of Kasparov playing the correct move is P and the average number of >moves >before it is clear the Kasparov won't make mistakes anymore, (for >example >when it is a clear draw) is M, his score would be P^M. This theory is clearly wrong. The events are not independent and playing perfect game can be a stupid idea. It is better to play a losing move when you know that your opponent is going to lose because of practical problems then to force a draw by perpetual check. Uri
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.