tower-of-hanoi.core — org.clojars.xbrln/tower-of-hanoi 0.1.0

print-moves clj

(print-moves n from to aux)

Print all the moves for solving the puzzle. n is the total number of disks. from, to and aux are the names for the rods.

total-moves clj

(total-moves n)

Calculate the number of moves for the given number of disks. n is the total number of disks. Formula: (2 pow n) - 1