Revision as of 07:54, 15 June 2011 (view source) Toucan (talk \| contribs) (adding gap) ← Older edit		Revision as of 13:06, 15 June 2011 (view source) 93.64.131.72 (talk) (Simpler first D version) Newer edit →
Line 206: =={{header\|D}}== ===Recursive=== <lang d>~~module~~import ~~hanoi~~std.stdio; }▼ ~~import std.stdio;~~ void hanoi(int n, char from, char to, char via) { ~~return~~ if (n > 0) ? {▼ ~~struct Hanoi {~~ hanoi(n - 1, from, via, to); ~~static Hanoi opCall(int n, string src, string dst, string via) {~~ writefln("Move disk %sd from %s to %s", n, ~~src~~from, ~~dst~~to) ;▼ ▲ return (n > 0) ? ~~Hanoi(n~~ - 1, ~~src,~~ ~~via,~~ ~~dst)(n,~~ ~~src,~~ ~~dst)~~ hanoi(n - 1, via, ~~dst~~to, ~~src~~from); } ~~: Hanoi.init ;~~ ▲ } ~~static Hanoi opCall(int n, string src, string dst) {~~ ▲ writefln("Move disk %s from %s to %s", n, src, dst) ; ~~return Hanoi.init ;~~ } } void main() { ~~Hanoi~~ hanoi(3, "'L"'," 'M"'," 'R"') ; }</lang> Output: <pre>Move disk 1 from L to M Move disk 2 from L to R Move disk 1 from M to R Move disk 3 from L to M Move disk 1 from R to L Move disk 2 from R to M Move disk 1 from L to M</pre> ===Iterative=== ref : [http://hanoitower.mkolar.org/shortestTHalgo.html The shortest and "mysterious" TH algorithm]

Towers of Hanoi (view source)