Author: Uri Blass
Date: 11:17:41 02/09/02
Go up one level in this thread
On February 09, 2002 at 13:25:45, Dan Andersson wrote: >>The fact that the event that strategy C may not win is possible does not >>contradict the fact that the probability for it is exactly 0. >To prove that we have to show that the number of non won games are finite. i.e. >show that over an infinite number of games the number of N of non won games will >be less than a number L (the requirement for a probability to be exactly zero). >I would like you to provide a simple proof. > >MvH Dan Andersson By the definition of my game there is only one non won games when both players never resign. If the player who does not resign plays against the player who resigns in 1% of the cases in every move then you get probability of 0.99^(k-1)*0.01 to finish the game after k moves for every k>=1 it is clear that the sum of these probabilities when k is a natural number(k=1,2,3....) is 1 so the probability that the game is finished is 1. 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.