Math

Tower of Hanoi

Solve the Tower of Hanoi with a visible recursive move sequence or legal manual moves. Compare your move count with the exact minimum 2^n − 1.

By Mykhailo Makarov

Actual application image

Try this

Follow the recursive solution or click a source peg and a destination peg for a legal manual move. Larger discs cannot cover smaller ones. Reset before resuming the recorded solution.

Equations used in the module

Equations
T(n) = 2 T(n−1) + 1; T(0) = 0
T(n) = 2^n − 1
Move n−1 to spare; move largest; move n−1 to target

Related experiments

Back to catalogue

Math

Rubik's cube as a group

Treat a Rubik cube as exact facelet permutations. Animate products, inverses, conjugation and a commutator, then inspect cycle counts and the order of the resulting group element.

Math

The del operator: grad, div, curl, Laplacian

Connect gradient, divergence, curl and Laplacian with visible fields, a movable probe and independently calculated boundary and area integrals.

Math

Klein bottle and the projective plane

Explore a Klein-bottle immersion and a Roman-surface image of the projective plane. Follow a local normal and inspect the identifications behind non-orientability.