ParentFull threadjdefarge·The optimal number of moves follows this recurrence relations: T(1) = 1 T(N) = 2 * T(N-1) + 1View on HN