Towers of Hanoi: Difference between revisions
no edit summary
(Added Ela) |
No edit summary |
||
Line 2,886:
The minimum number of moves to solve a 3-disk Tower of Hanoi is 7
</pre>
=={{header|Ring}}==
<lang ring>
move(4, 1, 2, 3)
func move n, src, dst, via
if n > 0 move(n - 1, src, via, dst)
see "" + src + " to " + dst + nl
move(n - 1, via, dst, src) ok
</lang>
=={{header|Ruby}}==
| |||