The double tower of Hanoi puzzle contains 2n discs. There are n different sizes, two(adsbygoogle = window.adsbygoogle || []).push({});

of each size. Initially one of the poles contains all the disks placed on top of each other in decreasing size. Discs of the same size are identical. You are allowed to

place discs of the same size on top of each other. Let an be the minimum number of moves

need to solve the puzzle. Find a recurrence relation for a_{1}, a_{2}, a_{3}, ...

This is what I came up with, and wanted to see if it was right:

a_{1}= 3

a_{n}= 2a_{n-1}+ 2.

Is this correct?

thanks

**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!

# Double Tower Of Hanoi

Loading...

Similar Threads - Double Tower Hanoi | Date |
---|---|

PDF of open ended double dice rolls | Sep 15, 2015 |

Paradox with elementary submodels of the constructible tower | May 20, 2012 |

PDF of double dice roll | May 12, 2011 |

Need a quick double-check on probability formula for 100-sided die | Jan 20, 2011 |

Double Monty - Action At A Distance? | Aug 3, 2008 |

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