Re:Flappy Bird creator, Dong Nguyen, taking down game; "I ca...
by jdefarge on Sunday February 09, 2014 @09:40PM
(#7208769)
The optimal number of moves follows this recurrence relations:
T(1) = 1
T(N) = 2 * T(N-1) + 1
[ Parent
| on HN ]
There are no comments on this comment yet.