By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
number of disks | 4
the 4-disk tower of Hanoi problem can be solved in 15 steps
Back to List | POWERED BY THE WOLFRAM LANGUAGE