Skip to content

Latest commit

 

History

History
10 lines (8 loc) · 313 Bytes

File metadata and controls

10 lines (8 loc) · 313 Bytes

Provide the solution to Towers of Hanoi

Given a number of disks return the sequence of moves to solve a Tower of Hanoi.

Challenge

Algorithm input is an integer number of disks. Output is a list of moves for solving.

Solution

Whiteboard Images