Tower of Hanoi: The Moves

Difficulty: 1300 2000 ms 128 MB

implementation

Print the optimal move sequence for an N-disc Tower of Hanoi from peg 1 to peg 3 (peg 2 is spare). Each line: from to.

Input: one integer N.

Output: 2^N−1 lines of moves.

Constraints:

• 1 ≤ N ≤ 15

Sample Tests

2

1 2
1 3
2 3

1

1 3

Read the Editorial