1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
def hanoi23(n):
    if n == 1 : 
        return [[2,3]]
    return hanoi21(n-1)+[[2,3]]+hanoi13(n-1)

def hanoi21(n):
    if n == 1 : 
        return [[2,1]]
    return hanoi23(n-1)+[[2,1]]+hanoi31(n-1)
def hanoi31(n):
    if n == 1 : 
        return [[3,1]]
    return hanoi32(n-1)+[[3,1]]+hanoi21(n-1)
    return hanoi
def hanoi32(n):
    if n == 1:
        return [[3,2]]
    return hanoi31(n-1)+[[3,2]]+hanoi12(n-1)
def hanoi12(n):
    if n == 1:
        return [[1,2]]
    return solution(n-1)+[[1,2]]+hanoi32(n-1)

def solution(n):
    answer = [[]]
    if n == 1 : 
        return [[1,3]]
    return hanoi12(n-1)+[[1,3]]+hanoi23(n-1)