Author: José Carlos
Date: 05:42:38 02/09/02
Go up one level in this thread
On February 09, 2002 at 07:44:27, Sune Fischer wrote: >On February 09, 2002 at 07:08:35, Uri Blass wrote: > >>returns. >> >>Imagine the following simple game: >>Every side need to say in it's turn if it resigns or not resign. >>The game is finished only when one side resigns. >> >>If both sides never resign the game is never finished. >> >> >>Imagine the following 3 programs for that simple game: >> >> >>Program A resigns with probability of 10% in every move >>Program B resigns with probability of 1% in every move >>Program C never resigns. >> >>program C finds better move than program B only in 1% of the cases but in games >>C always wins against B(B will do a mistake of resigning after enough moves). > >No, this is where you get it wrong IMO. >See C will not _always_ beat B, because the games will end at some point and >this will give B a winning probability greater than zero. I don't understand his point, but in the game he figured he said the game only finishes when one player resings, so if C never resings, C will never lose. As B has 1% probability of resigning, it will lose the game after 100 moves or so. José C.
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.