Revision as of 05:47, 1 December 2013 (view source) rosettacode>Balrog m (→‎{{header\|Groovy}}: cleanup) ← Older edit		Revision as of 15:54, 29 December 2013 (view source) rosettacode>Purple24 (→‎{{header\|Ruby}}) Newer edit →
Line 2,211: =={{header\|Ruby}}== <lang ruby>def move(num_disks, ~~starting_stick~~start=0, ~~target_stick~~target=1, ~~using_stick~~using=2) if num_disks == 1 @towers[target] << @towers[start].pop ~~target_stick << starting_stick.shift~~ puts "Move disk from #{start} to #{target} : #{@towers}" ~~status~~ else move(num_disks-1, ~~starting_stick~~start, ~~using_stick~~using, ~~target_stick~~target) move(1, ~~starting_stick~~ start, ~~target_stick~~target, ~~using_stick~~using) move(num_disks-1, ~~using_stick~~using, ~~target_stick~~target, ~~starting_stick~~start) end end~~</lang>~~ n = 5 @towers = [[*1..n].reverse, [], []] move(n)</lang>▼ {{out}} ~~<lang ruby>~~ <pre> ~~require 'pp'~~ Move disk from 0 to 1 : [[5, 4, 3, 2], [1], []] # solve(source, via, target)▼ Move disk from 0 to 2 : [[5, 4, 3], [1], [2]] Move disk from 1 to 2 : [[5, 4, 3], [], [2, 1]] Move disk from 0 to 1 : [[5, 4], [3], [2, 1]] Move disk from 2 to 0 : [[5, 4, 1], [3], [2]] Move disk from 2 to 1 : [[5, 4, 1], [3, 2], []] Move disk from 0 to 1 : [[5, 4], [3, 2, 1], []] Move disk from 0 to 2 : [[5], [3, 2, 1], [4]] Move disk from 1 to 2 : [[5], [3, 2], [4, 1]] Move disk from 1 to 0 : [[5, 2], [3], [4, 1]] Move disk from 2 to 0 : [[5, 2, 1], [3], [4]] Move disk from 1 to 2 : [[5, 2, 1], [], [4, 3]] Move disk from 0 to 1 : [[5, 2], [1], [4, 3]] Move disk from 0 to 2 : [[5], [1], [4, 3, 2]] Move disk from 1 to 2 : [[5], [], [4, 3, 2, 1]] Move disk from 0 to 1 : [[], [5], [4, 3, 2, 1]] Move disk from 2 to 0 : [[1], [5], [4, 3, 2]] Move disk from 2 to 1 : [[1], [5, 2], [4, 3]] Move disk from 0 to 1 : [[], [5, 2, 1], [4, 3]] Move disk from 2 to 0 : [[3], [5, 2, 1], [4]] Move disk from 1 to 2 : [[3], [5, 2], [4, 1]] Move disk from 1 to 0 : [[3, 2], [5], [4, 1]] Move disk from 2 to 0 : [[3, 2, 1], [5], [4]] Move disk from 2 to 1 : [[3, 2, 1], [5, 4], []] Move disk from 0 to 1 : [[3, 2], [5, 4, 1], []] Move disk from 0 to 2 : [[3], [5, 4, 1], [2]] Move disk from 1 to 2 : [[3], [5, 4], [2, 1]] Move disk from 0 to 1 : [[], [5, 4, 3], [2, 1]] Move disk from 2 to 0 : [[1], [5, 4, 3], [2]] Move disk from 2 to 1 : [[1], [5, 4, 3, 2], []] Move disk from 0 to 1 : [[], [5, 4, 3, 2, 1], []] </pre> or ▲<lang ruby># solve(source, via, target) # Example: # solve([5, 4, 3, 2, 1], [], []) Line 2,233 ⟶ 2,270: disks = towers.inject(0){\|sum, tower\| sum+tower.length} x=0 # sequence number ppp towers # initial trace # have we solved the puzzle yet? while towers.last.length < disks do Line 2,246 ⟶ 2,283: # ok, do it! towers[to].push(towers[from].pop) ppp towers # trace end end end end ▲</lang> solve([5, 4, 3, 2, 1], [], [])</lang> {{out}} <pre> [[5, 4, 3, 2, 1], [], []] [[5, 4, 3, 2], [], [1]] [[5, 4, 3], [2], [1]] [[5, 4, 3], [2, 1], []] [[5, 4], [2, 1], [3]] [[5, 4, 1], [2], [3]] [[5, 4, 1], [], [3, 2]] [[5, 4], [], [3, 2, 1]] [[5], [4], [3, 2, 1]] [[5], [4, 1], [3, 2]] [[5, 2], [4, 1], [3]] [[5, 2, 1], [4], [3]] [[5, 2, 1], [4, 3], []] [[5, 2], [4, 3], [1]] [[5], [4, 3, 2], [1]] [[5], [4, 3, 2, 1], []] [[], [4, 3, 2, 1], [5]] [[1], [4, 3, 2], [5]] [[1], [4, 3], [5, 2]] [[], [4, 3], [5, 2, 1]] [[3], [4], [5, 2, 1]] [[3], [4, 1], [5, 2]] [[3, 2], [4, 1], [5]] [[3, 2, 1], [4], [5]] [[3, 2, 1], [], [5, 4]] [[3, 2], [], [5, 4, 1]] [[3], [2], [5, 4, 1]] [[3], [2, 1], [5, 4]] [[], [2, 1], [5, 4, 3]] [[1], [2], [5, 4, 3]] [[1], [], [5, 4, 3, 2]] [[], [], [5, 4, 3, 2, 1]] </pre> =={{header\|Run BASIC}}== <lang runbasic>a = move(4, "1", "2", "3")

Towers of Hanoi: Difference between revisions

Towers of Hanoi (view source)

Revision as of 15:54, 29 December 2013