tag:blogger.com,1999:blog-7408525737943998966.post4379975922466198144..comments2024-03-19T10:21:36.942+00:00Comments on Gabriel Fernandes' Puzzle Collection: Rudenko DiscGabrielhttp://www.blogger.com/profile/00547574234341454265noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-7408525737943998966.post-87014756726015179792012-07-07T11:36:03.245+01:002012-07-07T11:36:03.245+01:00Yes. In the the normal hanoi, disk n can have at m...Yes. In the the normal hanoi, disk n can have at most n-1 disks on top of it, but that can only be if they are all in order of decreasing size.<br />With this puzzle, the movement restriction enforces the fact that disk n can have at most n-1 disks on top of it, as there simply is no room for more, but does not enforce anything about their size, including whether or not it includes disks larger than n.<br />In my 4-disk example above, I put disk 4 on top of disk 3, which leaves one remaining space above that, because disk 3 (yellow) has room for two disks above it. That space is just enough room to allow the remaining 2-disk tower to be transferred to between the other two places.jaaphttp://www.jaapsch.net/puzzles/noreply@blogger.comtag:blogger.com,1999:blog-7408525737943998966.post-77655036685290572432012-07-04T13:29:06.245+01:002012-07-04T13:29:06.245+01:00Thanks Jaap! That's good to know. I guess not ...Thanks Jaap! That's good to know. I guess not even the designer thought of that, because the solution has 127 steps. I'm a little confused, though. When you say you can put larger disks on top of smaller ones, you do know that the puzzle restricts your movements, right? For example, the yellow disk can't go any further than its own color, and they can't be physically removed.Gabrielhttps://www.blogger.com/profile/00547574234341454265noreply@blogger.comtag:blogger.com,1999:blog-7408525737943998966.post-31697588454561192302012-07-04T12:46:43.352+01:002012-07-04T12:46:43.352+01:00Actually the optimal solution is only 79 moves. Un...Actually the optimal solution is only 79 moves. Unlike normal hanoi, you can put 'larger' disks on top of 'smaller' ones, and so take shorter route. Four disks can be done in 13 moves:<br />Move 1&2 to peg 3 (3 moves)<br />Move 3&4 to peg 2, reversing order (2 moves)<br />Move 1&2 to peg 1 (3 moves)<br />Move 3&4 to peg 3, correcting order (2 moves)<br />Move 1&2 to peg 3 (3 moves)jaaphttp://www.jaapsch.net/puzzles/noreply@blogger.comtag:blogger.com,1999:blog-7408525737943998966.post-36250663517150799502012-03-16T11:35:28.338+00:002012-03-16T11:35:28.338+00:00That's odd. I checked my English instructions ...That's odd. I checked my English instructions and they have a 127 step ideal solution, but my original Russian instructions have indeed those 135 steps. If by any chance you want the 127 step solution, send me an e-mail and I'll get you a scan of mine.Gabrielhttps://www.blogger.com/profile/00547574234341454265noreply@blogger.comtag:blogger.com,1999:blog-7408525737943998966.post-70931203043933994272012-03-16T00:54:05.869+00:002012-03-16T00:54:05.869+00:00I was amused to discover that the given solution h...I was amused to discover that the given solution has 135 moves, 8 more than is required.<br /><br />NickAnonymousnoreply@blogger.com