The optimal number of moves follows this recurrence relations: T(1) = 1 T(N) = 2... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

jdefarge on Feb 10, 2014 | parent | context | favorite | on: Flappy Bird creator, Dong Nguyen, taking down game...

The optimal number of moves follows this recurrence relations: T(1) = 1 T(N) = 2 * T(N-1) + 1

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact