Towers of Hanoi: Difference between revisions

Towers of Hanoi (view source)

Revision as of 19:10, 6 April 2024

4,689 bytes added , 1 month ago

Added Uiua solution

Midaz

73

edits

Revision as of 10:04, 30 May 2023 (view source) Not a robot (talk \| contribs) (Add MACRO-11) ← Older edit		Revision as of 19:10, 6 April 2024 (view source) Midaz (talk \| contribs) (Added Uiua solution) Newer edit →
(11 intermediate revisions by 8 users not shown)
Line 419: </syntaxhighlight> =={{header\|ABC}}== <syntaxhighlight lang="ABC">HOW TO MOVE n DISKS FROM src VIA via TO dest: IF n>0: MOVE n-1 DISKS FROM src VIA dest TO via WRITE "Move disk from pole", src, "to pole", dest/ MOVE n-1 DISKS FROM via VIA dest TO src MOVE 4 DISKS FROM 1 VIA 2 TO 3</syntaxhighlight> {{out}} <pre>Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 1 Move disk from pole 1 to pole 2 Move disk from pole 3 to pole 2 Move disk from pole 3 to pole 1 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 1 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 2 to pole 1 Move disk from pole 3 to pole 1 Move disk from pole 3 to pole 2 Move disk from pole 1 to pole 3</pre> =={{header\|Action!}}== Line 1,146 ⟶ 1,171: 15: 3 TO 2 </pre> ==={{header\|BASIC256}}=== <syntaxhighlight lang="basic256">call move(4,1,2,3) print "Towers of Hanoi puzzle completed!" Line 1,178 ⟶ 1,203: Towers of Hanoi puzzle completed! </pre> ==={{header\|IS-BASIC}}=== <syntaxhighlight lang="is-basic">100 PROGRAM "Hanoi.bas" 110 CALL HANOI(4,1,3,2) 120 DEF HANOI(DISK,FRO,TO,WITH) 130 IF DISK>0 THEN 140 CALL HANOI(DISK-1,FRO,WITH,TO) 150 PRINT "Move disk";DISK;"from";FRO;"to";TO 160 CALL HANOI(DISK-1,WITH,TO,FRO) 170 END IF 180 END DEF</syntaxhighlight> =={{header\|Batch File}}== Line 2,189 ⟶ 2,225: proc hanoi n src dst aux . . if n >= 1 ~~call~~ hanoi n - 1 src aux dst print "Move " & src & " to " & dst ~~call~~ hanoi n - 1 aux dst src . . ~~call~~ hanoi 5 1 2 3 </syntaxhighlight> Line 2,470 ⟶ 2,506: (message "Move from %S to %S" from to) (move (- n 1) via to from)))</syntaxhighlight> =={{header\|EMal}}== {{trans\|C#}} <syntaxhighlight lang="emal"> fun move = void by int n, int from, int to, int via if n == 1 writeLine("Move disk from pole " + from + " to pole " + to) return end move(n - 1, from, via, to) move(1, from, to, via) move(n - 1, via, to, from) end move(3, 1, 2, 3) </syntaxhighlight> {{out}} <pre> Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 3 to pole 1 Move disk from pole 3 to pole 2 Move disk from pole 1 to pole 2 </pre> =={{header\|Erlang}}== Line 2,973 ⟶ 3,034: =={{header\|Fōrmulæ}}== {{FormulaeEntry\|page=https://formulae.org/?script=examples/Tower_of_Hanoi}} Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation —i.e. XML, JSON— they are intended for storage and transfer purposes more than visualization and edition. '''Solution''' Programs in Fōrmulæ are created/edited online in its [https://formulae.org website], However they run on execution servers. By default remote servers are used, but they are limited in memory and processing power, since they are intended for demonstration and casual use. A local server can be downloaded and installed, it has no limitations (it runs in your own computer). Because of that, example programs can be fully visualized and edited, but some of them will not run if they require a moderate or heavy computation/memory resources, and no local server is being used. [[File:Fōrmulæ - Tower of Hanoi 01.png]] ~~In '''[https://formulae.org/?example=Tower_of_Hanoi this]''' page you can see the program(s) related to this task and their results.~~ '''Test case''' [[File:Fōrmulæ - Tower of Hanoi 02.png]] [[File:Fōrmulæ - Tower of Hanoi 03.png]] =={{header\|Gambas}}== Line 3,379 ⟶ 3,446: H(n, 1, 2, 3) )</syntaxhighlight> ~~=={{header\|IS-BASIC}}==~~ ~~<syntaxhighlight lang="is-basic">100 PROGRAM "Hanoi.bas"~~ ~~110 CALL HANOI(4,1,3,2)~~ ~~120 DEF HANOI(DISK,FRO,TO,WITH)~~ ~~130 IF DISK>0 THEN~~ ~~140 CALL HANOI(DISK-1,FRO,WITH,TO)~~ ~~150 PRINT "Move disk";DISK;"from";FRO;"to";TO~~ ~~160 CALL HANOI(DISK-1,WITH,TO,FRO)~~ ~~170 END IF~~ ~~180 END DEF</syntaxhighlight>~~ =={{header\|J}}== Line 6,027 ⟶ 6,083: left -> middle right -> middle</pre> =={{header\|Refal}}== <syntaxhighlight lang="refal">$ENTRY Go { = <Move 4 1 2 3>; }; Move { 0 e.X = ; s.N s.Src s.Via s.Dest, <- s.N 1>: s.Next = <Move s.Next s.Src s.Dest s.Via> <Prout "Move disk from pole" s.Src "to pole" s.Dest> <Move s.Next s.Via s.Src s.Dest>; };</syntaxhighlight> {{out}} <pre>Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 3 to pole 1 Move disk from pole 3 to pole 2 Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3 Move disk from pole 2 to pole 1 Move disk from pole 3 to pole 1 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3</pre> =={{header\|Retro}}== Line 6,523 ⟶ 6,608: end if; end func;</syntaxhighlight> =={{header\|SETL}}== <syntaxhighlight lang="setl">program hanoi; loop for [src, dest] in move(4, 1, 2, 3) do print("Move disk from pole " + src + " to pole " + dest); end loop; proc move(n, src, via, dest); if n=0 then return []; end if; return move(n-1, src, dest, via) + [[src, dest]] + move(n-1, via, src, dest); end proc; end program;</syntaxhighlight> {{out}} <pre>Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 3 to pole 1 Move disk from pole 3 to pole 2 Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3 Move disk from pole 2 to pole 1 Move disk from pole 3 to pole 1 Move disk from pole 2 to pole 3 Move disk from pole 1 to pole 2 Move disk from pole 1 to pole 3 Move disk from pole 2 to pole 3</pre> =={{header\|Sidef}}== Line 6,920 ⟶ 7,035: EndIf Return</syntaxhighlight> =={{header\|Uiua}}== {{works with\|Uiua\|0.10.0}} <syntaxhighlight lang="bash"> F ← \|1.0 ( ⟨ &p ⊏[1 2] &pf "Move disc [from to]: " \| F⍜(⊡0\|-1)⍜(⊏[2 3]\|⇌). F⍜(⊡0\|1◌). F⍜(⊡0\|-1)⍜(⊏[1 3]\|⇌) ⟩≠1⊢. ) F [4 1 2 3] </syntaxhighlight> {{out}} <pre> Move disc [from to]: [1 3] Move disc [from to]: [1 2] Move disc [from to]: [3 2] Move disc [from to]: [1 3] Move disc [from to]: [2 1] Move disc [from to]: [2 3] Move disc [from to]: [1 3] Move disc [from to]: [1 2] Move disc [from to]: [3 2] Move disc [from to]: [3 1] Move disc [from to]: [2 1] Move disc [from to]: [3 2] Move disc [from to]: [1 3] Move disc [from to]: [1 2] Move disc [from to]: [3 2] </pre> =={{header\|UNIX Shell}}== Line 6,994 ⟶ 7,141: start -> end middle -> end</pre> =={{header\|Uxntal}}== <syntaxhighlight lang="Uxntal">\|10 @Console &vector $2 &read $1 &pad $4 &type $1 &write $1 &error $1 \|0100 ( -> ) #0102 [ LIT2 03 &count 04 ] hanoi POP2 POP2 BRK @hanoi ( from spare to count -: from spare to count ) ( moving 0 disks is no-op ) DUP ?{ JMP2r } ( move disks 1..count-1 to the spare peg ) #01 SUB ROT SWP hanoi ( from to spare count-1 ) ( print the current move ) ;dict/move print-str INCk #30 ORA .Console/write DEO STH2 ;dict/from print-str OVR #30 ORA .Console/write DEO ;dict/to print-str DUP #30 ORA .Console/write DEO [ LIT2 0a -Console/write ] DEO STH2r ( move disks 1..count-1 from the spare peg to the goal peg ) STH ROT ROT STHr hanoi ( restore original parameters for convenient recursion ) STH2 SWP STH2r INC JMP2r @print-str &loop LDAk .Console/write DEO INC2 LDAk ?&loop POP2 JMP2r @dict &move "Move 20 "disk 2000 &from 20 "from 20 "pole 2000 &to 20 "to 20 "pole 2000</syntaxhighlight> =={{header\|VBScript}}== Line 7,099 ⟶ 7,291: End Sub End Module</syntaxhighlight> =={{header\|V (Vlang)}}== <syntaxhighlight lang="Zig"> fn main() { hanoi(4, "A", "B", "C") } fn hanoi(n u64, a string, b string, c string) { if n > 0 { hanoi(n - 1, a, c, b) println("Move disk from ${a} to ${c}") hanoi(n - 1, b, a, c) } } </syntaxhighlight> {{out}} <pre> Move disk from A to B Move disk from A to C Move disk from B to C Move disk from A to B Move disk from C to A Move disk from C to B Move disk from A to B Move disk from A to C Move disk from B to C Move disk from B to A Move disk from C to A Move disk from B to C Move disk from A to B Move disk from A to C Move disk from B to C </pre> =={{header\|VTL-2}}== Line 7,174 ⟶ 7,400: =={{header\|Wren}}== {{trans\|Kotlin}} <syntaxhighlight lang="~~ecmascript~~wren">class Hanoi { construct new(disks) { _moves = 0