Computer Chess Club Archives

Search

Messages

Subject: Re: Completely and shamefully OT question about algorithm analysis

Author: Dan Andersson

Date: 13:24:42 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 token 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

• Correction. Dan Andersson 13:27:14 02/27/05
  • Re: Correction. Andrew Wagner 14:06:20 02/27/05
    • Re: Correction. Dan Andersson 14:24:44 02/27/05

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.