Hanoi tower solver for three towers, return list of tupples (actsions) --> (from, to)

hanoi.rkt

; list of actions
; - n počet disků

; move tower to c
; last stage to 2

(define (hanoi n a b c)
  (cond
    ((eq? n 1) (list(cons a b))) ; jedno patro dám rovnou na b
    (#t (append (hanoi (- n 1) a c b) (list(cons a b))
                (hanoi (- n 1) c b a)
                ))
    )
  )