5 ms·The optimal number of moves follows this recurrence relations: T(1) = 1 T(N) = 2 * T(N-1) + 1by jdefarge 13y agoThe optimal number of moves follows this recurrence relations: T(1) = 1 T(N) = 2 * T(N-1) + 1