Author: Dan Andersson
Date: 13:27:14 02/27/05
Go up one level in this thread
> As far as I can see, this random algorithm is equivalent to this >combinatorial/probability problem: > Given a bag of N tokens. How many times will you need to draw a random > token and lay the token back >until you >have seen them all? > A hint: Expected number of tokens drawn for the first one is 1. And for the >second 1 plus the sum of probabilities for one to an infinite number of misses. > >MvH Dan Andersson
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.