Author: Dan Andersson
Date: 14:24:44 02/27/05
Go up one level in this thread
If I'm not to tired the answer goes something like this: Number of tries per correct number is N/(N-K) K<N wher K is number of picked tokens. That gives N numbers from 1 to N and the sum is propotional by N times the truncated harmonic series H(n). O(H(N)*N) where H(n)=gamma+digamma(n+1). Could be all wrong though. MvH Dan Andersson
This page took 0.01 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.