tag:blogger.com,1999:blog-3127964892896786744.post4544782407828925370..comments2010-04-23T14:26:36.697-07:00Comments on Unravel Every Riddle: Towers of HanoiDTRhttp://www.blogger.com/profile/18414851667887352410noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-3127964892896786744.post-49281117594125239322008-06-27T11:36:00.000-07:002008-06-27T11:36:00.000-07:00That's right, Michelle. That explains why the num...That's right, Michelle. That explains why the number of moves essentially doubles for each additional disk. The shortest possible sequence for moving n disks involves (2^n)-1 moves. Moving ten disks requires at least 1023 moves. Six disks can be moved in 63 moves.DTRhttps://www.blogger.com/profile/18414851667887352410noreply@blogger.comtag:blogger.com,1999:blog-3127964892896786744.post-66140984612254496032008-06-27T00:41:00.000-07:002008-06-27T00:41:00.000-07:00I did 6. I seem to remember there being some conn...I did 6. I seem to remember there being some connection with binary numbers, but I can't recreate it. In any case, there is a definite pattern to solve it, it's just all subsets of the smaller disk cases (move the top n-1 disks to the middle, then move the nth over, and undo the moves to put the n-1 disks on top).Michellehttps://www.blogger.com/profile/07213753945535336627noreply@blogger.comtag:blogger.com,1999:blog-3127964892896786744.post-20191909759770804552008-06-25T07:21:00.000-07:002008-06-25T07:21:00.000-07:00I did 6, I'd need more time to complete more. fini...I did 6, I'd need more time to complete more. finished in less than 10 minutes though.Lincolnloggerhttps://www.blogger.com/profile/04259863400334694594noreply@blogger.com