tag:blogger.com,1999:blog-9124539381685751273.post5615823846577735628..comments2023-06-19T04:35:06.263-07:00Comments on Skeptic's Play: Solution to Tower of Hanoi variantmillerhttp://www.blogger.com/profile/05990852054891771988noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-9124539381685751273.post-72147284254027042822012-04-16T10:17:41.881-07:002012-04-16T10:17:41.881-07:00I was just researching the hanoi problem, and saw ...I was just researching the hanoi problem, and saw your entry, and... is really easy give a proof of the maximum number of movements, without giving a solution, and you can create and algoritm that solves this problem for any number of disks in the minimum number of movements, so the answer of the maximum number of disks you can move is infinite.Anonymousnoreply@blogger.com