The above algorithm is a function in Matlab that solves the problem of the Hanoi towers. This function is recursive, making an iterative function that solves the problem of the towers of Hanoi.

function hanoi (n,A, B,C) if n--1 fprintf ('%d de %d-> %d', n, A, C) ; else hanoi (n-1, A, C, B) fprintf ('ined de %d-> %d ', n, A, C) ; hanoi (n-1,B, A, C) end end