1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/*
* SPL - The SPL Programming Language
* Copyright (C) 2004, 2005 Clifford Wolf <clifford@clifford.at>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* hanoi.spl: Playing towers of hanoi in an endless loop
*/
load "termio";
var stacks;
for (var i=10; i>0; i--)
push stacks[0], i;
function draw() {
termio_clear();
for (var s=0; s<3; s++) {
var line = 0;
foreach i (stacks[s]) {
termio_setpos(s * 25 + 5, 15 - line++);
for (var j=stacks[s][i]; j<10; j++) write(" ");
for (var j=0; j<stacks[s][i]*2; j++) write("*");
}
termio_setpos(s * 25 + 3, 16);
for (var j=0; j<24; j++) write("=");
}
termio_setpos(1, 1);
}
function hanoi(from, to, temp, num) {
if (num) hanoi(from, temp, to, num-1);
push stacks[to], pop stacks[from];
draw();
termio_sleep();
if (num) hanoi(temp, to, from, num-1);
}
while (1) {
hanoi(0, 2, 1, 9);
hanoi(2, 1, 0, 9);
hanoi(1, 0, 2, 9);
}
|
