There is a famous problem called the tower of hanoi in which you have n disks of increasing diameter, and three pegs. The object is to move them from one peg to another in such a way that no larger disk is on top of a smaller disk.(adsbygoogle = window.adsbygoogle || []).push({});

the number of moves is defined by

[tex]

T(n)=2^{n}-1

[/tex]

A far more interesting and complicated problem, is, what is the minimum number of moves if you have 4 pegs instead of three?

Bonus: what is a formula in terms of

W(n) and T(n) --(where W(n) is the 4 peg number and T(n) is the number of 3 peg moves).

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Tower of hanoi

Loading...

Similar Threads for Tower hanoi | Date |
---|---|

News London Tower Block Fire | Jun 14, 2017 |

Falcon 9 has cleared the tower | Dec 8, 2010 |

10 km Tower | Nov 9, 2010 |

Riddle from the dark tower series | Jan 23, 2010 |

9-level Tower of Hanoi variant | Jan 4, 2009 |

**Physics Forums - The Fusion of Science and Community**