Sandbox::https://github.com/sibalonecoding-code/JavaScript/blob/master/Recursive/TowerOfHanoi.js

Repository navigation

18 lines (15 loc) · 542 Bytes

// wiki - https://en.wikipedia.org/wiki/Tower_of_Hanoi

// Recursive Javascript function to solve tower of hanoi

export function TowerOfHanoi(n, from, to, aux, output = []) {

if (n === 1) {

output.push(`Move disk 1 from rod ${from} to rod ${to}`)

return output

}

TowerOfHanoi(n - 1, from, aux, to, output)

output.push(`Move disk ${n} from rod ${from} to rod ${to}`)

TowerOfHanoi(n - 1, aux, to, from, output)

return output

}

// Driver code (A, C, B are the name of rods)

// const n = 4

// TowerOfHanoi(n, 'A', 'C', 'B')