Repository navigation
Expand file tree
/
Copy pathreverse.js
More file actions
159 lines (149 loc) · 4.75 KB
/
Copy pathreverse.js
File metadata and controls
159 lines (149 loc) · 4.75 KB
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
// REVERSE
//
// Converted from BASIC to Javascript by Oscar Toledo G. (nanochess)
//
function print(str)
{
document.getElementById("output").appendChild(document.createTextNode(str));
}
function input()
{
var input_element;
var input_str;
return new Promise(function (resolve) {
input_element = document.createElement("INPUT");
print("? ");
input_element.setAttribute("type", "text");
input_element.setAttribute("length", "50");
document.getElementById("output").appendChild(input_element);
input_element.focus();
input_str = undefined;
input_element.addEventListener("keydown", function (event) {
if (event.keyCode == 13) {
input_str = input_element.value;
document.getElementById("output").removeChild(input_element);
print(input_str);
print("\n");
resolve(input_str);
}
});
});
}
function tab(space)
{
var str = "";
while (space-- > 0)
str += " ";
return str;
}
var a = [];
var n;
// Subroutine to print the rules
function print_rules()
{
print("\n");
print("THIS IS THE GAME OF 'REVERSE'. TO WIN, ALL YOU HAVE\n");
print("TO DO IS ARRANGE A LIST OF NUMBERS (1 THROUGH " + n + ")\n");
print("IN NUMERICAL ORDER FROM LEFT TO RIGHT. TO MOVE, YOU\n");
print("TELL ME HOW MANY NUMBERS (COUNTING FROM THE LEFT) TO\n");
print("REVERSE. FOR EXAMPLE, IF THE CURRENT LIST IS:\n");
print("\n");
print("2 3 4 5 1 6 7 8 9\n");
print("\n");
print("AND YOU REVERSE 4, THE RESULT WILL BE:\n");
print("\n");
print("5 4 3 2 1 6 7 8 9\n");
print("\n");
print("NOW IF YOU REVERSE 5, YOU WIN!\n");
print("\n");
print("1 2 3 4 5 6 7 8 9\n");
print("\n");
print("NO DOUBT YOU WILL LIKE THIS GAME, BUT\n");
print("IF YOU WANT TO QUIT, REVERSE 0 (ZERO).\n");
print("\n");
}
// Subroutine to print list
function print_list()
{
print("\n");
for (k = 1; k <= n; k++)
print(" " + a[k] + " ");
print("\n");
print("\n");
}
// Main program
async function main()
{
print(tab(32) + "REVERSE\n");
print(tab(15) + "CREATIVE COMPUTING MORRISTOWN, NEW JERSEY\n");
print("\n");
print("\n");
print("\n");
print("REVERSE -- A GAME OF SKILL\n");
print("\n");
for (i = 0; i <= 20; i++)
a[i] = 0;
// *** N=NUMBER OF NUMBER
n = 9;
print("DO YOU WANT THE RULES? (YES OR NO)");
str = await input();
if (str.toUpperCase() === "YES" || str.toUpperCase() === "Y")
print_rules();
while (1) {
// *** Make a random list a(1) to a(n)
a[1] = Math.floor((n - 1) * Math.random() + 2);
for (k = 2; k <= n; k++) {
do {
a[k] = Math.floor(n * Math.random() + 1);
for (j = 1; j <= k - 1; j++) {
if (a[k] == a[j])
break;
}
} while (j <= k - 1) ;
}
// *** Print original list and start game
print("\n");
print("HERE WE GO ... THE LIST IS:\n");
t = 0;
print_list();
while (1) {
while (1) {
print("HOW MANY SHALL I REVERSE");
r = parseInt(await input());
if (r == 0)
break;
if (r <= n)
break;
print("OOPS! WRONG! I CAN REVERSE AT MOST " + n + "\n");
}
if (r == 0)
break;
t++;
// *** Reverse r numbers and print new list
for (k = 1; k <= Math.floor(r / 2); k++) {
z = a[k];
a[k] = a[r - k + 1];
a[r - k + 1] = z;
}
print_list();
// *** Check for a win
for (k = 1; k <= n; k++) {
if (a[k] != k)
break;
}
if (k > n) {
print("YOU WON IT IN " + t + " MOVES!!!\n");
print("\n");
break;
}
}
print("\n");
print("TRY AGAIN? (YES OR NO)");
str = await input();
if (str.toUpperCase() === "NO" || str.toUpperCase() === "N")
break;
}
print("\n");
print("O.K. HOPE YOU HAD FUN!!\n");
}
main();