Towers of Hanoi: Difference between revisions

Towers of Hanoi (view source)

Revision as of 18:21, 6 September 2015

129 bytes added , 8 years ago

m

→‎simple text moves: added/changed whitespace and comments, changed the wording of the output.

Anonymous user

rosettacode>Gerard Schildberger

Revision as of 17:23, 6 September 2015 (view source) Trizen (talk \| contribs) m (Added the Sidef language) ← Older edit		Revision as of 18:21, 6 September 2015 (view source) rosettacode>Gerard Schildberger m (→‎simple text moves: added/changed whitespace and comments, changed the wording of the output.) Newer edit →
Line 2,506: =={{header\|REXX}}== ===simple text moves=== <lang rexx>/REXX program shows the moves to solve the Tower of Hanoi (with N ~~towers~~disks)./ parse arg N . /get optional number of disks from CL./ if N=='' then N=3 /Not given? Then use default 3 towers/ #=0; z=2*N - 1 /# ~~ring~~disk moves so far; # of min moves./ call mov 1, 3, N /move the top ~~ring~~disk, then recurse ··· / say say 'The minimum number of moves to solve a ' N"-disk " Tower of Hanoi is " z exit /stick a fork in it, we're all done. / /────────────────────────────────────────────────────────────────────────────/ /─────────────────────────────DSK subroutine─────────────────────────────────/ dsk: #=#+1 /bump the (~~ring~~disk) move counter by one. / say 'step' right(#,length(z))": move disk on tower" arg(1) '───►' arg(2) ~~return~~ return / [↑] display the move message (text)/ /────────────────────────────────────────────────────────────────────────────/ /─────────────────────────────MOV subroutine─────────────────────────────────*/ mov: procedure expose # z; parse arg @1, @2, @3 if @3==1 then call dsk @1, @2 else do call mov @1, 6-@1-@2, @3-1 call mov @1, @2, 1 call mov 6-@1-@2, @2, @3-1 end return</lang> ~~{{out}}~~'''output'''   when using the default input ~~was used~~: <pre> step 1: move disk on tower 1 ───► 3 Line 2,537: step 7: move disk on tower 1 ───► 3 The minimum number of moves to solve a 3-disk Tower of Hanoi is 7 </pre> ~~{{out}}~~'''output'''   when the following was entered (to solve with four ~~towers~~disks):   <tt> 4 </tt> <pre> step 1: move disk on tower 1 ───► 2 Line 2,558 ⟶ 2,557: step 15: move disk on tower 2 ───► 3 The minimum number of moves to solve a 4-disk Tower of Hanoi is 15 </pre>