forked from bormand/nanochess
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathtoledo_javascript_chess_3.html
354 lines (333 loc) · 14.5 KB
/
toledo_javascript_chess_3.html
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
<script>
//(c)2010 Oscar Toledo G.
// Chessboard structure (array "board"):
// 0 1 2 3 4 5 6 7 8 9
// 00 -- -- -- -- -- -- -- -- -- --
// 10 -- -- -- -- -- -- -- -- -- --
// 20 -- A8 B8 C8 D8 E8 F8 G8 H8 --
// 30 -- A7 B7 C7 D7 E7 F7 G7 H7 --
// 40 -- A6 B6 C6 D6 E6 F6 G6 H6 --
// 50 -- A5 B5 C5 D5 E5 F5 G5 H5 --
// 60 -- A4 B4 C4 D4 E4 F4 G4 H4 --
// 70 -- A3 B3 C3 D3 E3 F3 G3 H3 --
// 80 -- A2 B2 C2 D2 E2 F2 G2 H2 --
// 90 -- A1 B1 C1 D1 E1 F1 G1 H1 --
// 100 -- -- -- -- -- -- -- -- -- --
// 110 -- -- -- -- -- -- -- -- -- --
//
// Piece codes:
// 1 - pawn 4 - bishop
// 2 - king 5 - rook
// 3 - knight 6 - queen
//
// White pieces or'ed with 0x08, pieces that wasn't moved or'ed with 0x10.
// So, for example, white king has code 0x1A and after it's first move becomes 0x0A.
// Area outside of the chessboard filled with 0x07, empty cells contain 0x00.
var moveFrom, // source position of the move
curPieceCode, // current piece code
curPlayer, // current player: 0 - white, 8 - black
pawn2SquareMove, // position of pawn after two-square move, 0 after any other move
moveTo, // target position of the move
I = [],
board = [], // chessboard (12 rows x 10 columns, see wiki for more info)
C120 = 120,
C10 = 10, // just ten ;)
C15 = 15, // just fifteen ;)
C10000 = 10000,
piecesCosts = [0,99,0,306,297,495,846], // cost of the pieces (empty,pawn,king,knight,bishop,rook,queen)
rowsCosts = [-1,0,1,2,2,1,0,-1]; // cost of the rows/columns
function movesForPiece(piece) {
var moves = [
[9,11,10,20], // black pawn
[-1,1,-10,10,-11,-9,9,11], // king
[-21,-19,-12,-8,8,12,19,21], // knight
[-11,-9,9,11], // bishop
[-1,1,-10,10], // rook
[-1,1,-10,10,-11,-9,9,11] // queen
];
// for white pawn
if ((piece & 15) == 9)
return [-9,-11,-10, -20];
// for other pieces
return moves[(piece & 7) - 1];
}
function executeMove(O, p, n, m, g) {
board[p] = n;
if (m) {
board[g] = board[m];
board[m] = 0;
} else if (g) {
board[g] = 0;
}
board[O] = 0;
}
function undoMove(O, p, o, r, m, g) {
board[O] = o;
board[p] = r;
if (m) {
board[m] = board[g];
board[g] = 0;
} else if (g) {
board[g] = 9 ^ curPlayer;
}
}
// When w=0 function scans all possible moves, otherwise just that ends up at w
// c - cutoff threshold. Function returns if h>0 and move with heuristic greater than c found
// h - current depth (starts with 0)
// e - cell from which moves enumeration starts (usually 21, "A8")
// S - position of pawn after two-square move, 0 after any other move
// s - scan depth (1 - verify B -> b and execute it,
// 0 - used for check checking (returns above 70k when opponent's king under attack)
function compute(w,cutoff,currDepth,startCell,pawn2SquareMoveParam,scanDepth) {
var t,
o,
L, // heuristic of the current move
E,
d,
O = startCell,
N = -C10000*C10000, // heuristic of the best move
K = (78 - currDepth) << C10, // cost of the check
p,
g, // "en passant" or castling target position
n,
m, // castling source position
q,
r,
C,
J,
a = curPlayer ? -C10 : C10, // +10 for white, -10 for black
moves;
curPlayer ^= 8;
C120++;
d = w || (scanDepth && scanDepth>=currDepth && compute(0,0,0,21,0,0) > C10000);
// loop for all cells starting with e (usually 21, "A8") and finishing just before e
// O - current cell, read-only inside loop
do {
p = O; // current position
o = board[p]; // current piece code (or'ed with 16) or 0 or 7
if (o) { // if cell isn't empty
q = o & C15 ^ curPlayer; // current piece code (1..6 for current player, 9..14 for opponent, 7 or 15 - outside)
if (q < 7) {
q--;
moves = movesForPiece(o);
C = 0;
// q decreased: 0 pawn, 1 king, 2 knight, 3 bishop, 4 rook, 5 queen
// check each possible move of the current piece
// C,q,o are read-only inside loop
do {
p += moves[C]; // target cell position
r = board[p]; // piece code at the target cell, read-only below
if (!w | p == w) { // required target cell not specified or equals to current target
g = (q == 0 && p + a == pawn2SquareMoveParam) ? pawn2SquareMoveParam : 0; // en passant
if ((!r & (!!q | C>1 || !!g)) || ((r+1&C15^curPlayer)>9 && (q | C<2))) {
m = !(r - 2 & 7); // king on the target cell, check!
if (m) {
curPlayer ^= 8;
I[C120--] = O;
return K;
}
// m is 0 after this point
J = n = o & C15; // J & n - current piece code
E = board[p - a] & C15; // piece at the cell above target (for white) or below target (for black)
// for pawn on the last line loop runs from n=3 (or 11) to t=6 (or 14) (promotions)
// for king loop can run two times if castling is possible
// for any other piece loop runs only once with n = t = piece code
t = (q | E-7) ? n : (n+=2,6^curPlayer);
while (n <= t) {
// Heuristic:
// For attack moves:
// + attacked piece cost
// pawn: 99, knight: 306, bishop: 297, rook: 495, queen: 846
// - attacker piece cost
// pawn: 0, king: 1, knight: 2, bishop: 3, rook: 4, queen: 5
// - current depth
// For king:
// +9 for castling
// For all except king:
// + for target row
// - for source row
// 1:-1, 2:0, 3:1, 4:2, 5:2, 6:1, 7:0, 8:-1
// + for target column (doubled for pawns)
// - for source column
// A:-1, B:0, C:1, D:2, E:2, F:1, G:0, H:-1
// +8 if piece doesn't moved before
// For pawn:
// -99 if current move isn't "en passant"
// +1 if have own pawn to the left/right of the target cell
// + for promotion:
// knight: 306, bishop: 297, rook: 495, queen: 846
// +1 for two-square move
// For all:
// +1 for blocking opponent's pawn
L = r ? piecesCosts[r&7]-currDepth-q : 0; // value of the attacked piece (0 for empty cell)
if (scanDepth) {
L+=((1-q) ? rowsCosts[(p-p%C10)/C10-2] - rowsCosts[(O-O%C10)/C10-2] +
rowsCosts[p%C10-1]*(q?1:2) - rowsCosts[O%C10-1] + (o&16)/2
: !!m * 9) +
(!q ? !(board[p-1]^n) + !(board[p+1]^n) + piecesCosts[n&7] - 99 + !!g * 99 + (C == 3)
: 0) +
!(E ^ curPlayer ^ 9);
}
if ((scanDepth > currDepth) || ((1<scanDepth & scanDepth==currDepth) && (L>C15 | d))) {
// execute move
executeMove(O, p, n, m, g);
// find opponent's best move
J = (q | C<3) ? 0 : p;
L -= compute((scanDepth > currDepth | d) ? 0 : p,
L - N,
currDepth + 1,
I[C120+1],
J,
scanDepth);
// if we in check mode (s==1) and current move (O,p,n) same as player's (B,b,i)
// and move is possible then update chessboard and return
if (!currDepth && scanDepth == 1 && moveFrom == O && curPieceCode == n && p == moveTo && L >= -C10000) {
DrawPieces();
C120--;
pawn2SquareMove = J;
return pawn2SquareMove;
}
// is castling possible?
J = (q-1 | C>1) || m || (!scanDepth | d | r | o<C15) || compute(0,0,0,21,0,0) > C10000;
// undo move
undoMove(O, p, o, r, m, g);
}
// if current move has better heuristic
if (L>N || (scanDepth>1 && L==N && !currDepth && Math.random()<.5)) {
I[C120] = O;
if (scanDepth > 1) {
// cutoff
if (currDepth && L > cutoff) {
curPlayer ^= 8;
C120--;
return L;
}
// output this move
if (!currDepth) {
curPieceCode = n;
moveFrom = O;
moveTo = p;
}
}
N = L;
}
// try castling if J == 0
n += J || (g = p,
m = (p < O) ? g-3 : g+2,
(board[m] < C15 | board[m+O-p]) || board[p+=p-O]) ? 1 : 0;
}
}
}
// If target cell was empty and current piece is rook, queen or bishop -
// try to move further in same direction. otherwise try next move from table
// skip two-square move for pawn if it was moved, or square ahead of it is occupied.
} while ((!r & q>2) || (p=O, (q | C < 2 | o > C15 & !r) && (++C < moves.length)));
}
}
} while ((++O > 98) ? O = 20 : startCell - O);
curPlayer ^= 8;
C120--;
return (N + C10000*C10000 && (N > 1924-K | d)) ? N : 0;
}
curPlayer = pawn2SquareMove = 0;
function SetupChessboard() {
var x, y;
var i = 0;
var initial = [
5, 3, 4, 6, 2, 4, 3, 5,
1, 1, 1, 1, 1, 1, 1, 1,
9, 9, 9, 9, 9, 9, 9, 9,
13, 11, 12, 14, 10, 12, 11, 13
];
for (y=0; y<12; y++) {
for (x=0; x<10; x++) {
if (x<1 || y<2 || x>8 || y>9) {
// outside
board[y*10+x] = 7;
} else if (y>=4 && y<=7) {
// empty
board[y*10+x] = 0;
} else {
// pieces
board[y*10+x] = initial[i++] | 16;
}
}
}
}
function CreateChessboardView() {
var x, y, i;
var a = "<table cellspacing=0 align=center>";
for (y=0; y<8; y++) {
a += "<tr>";
for (x=0; x<8; x++) {
i = y*10 + x + 21;
a += "<th width=60 height=60 onclick=OnClick(" + i + ") id=o" + i +
" style='line-height:50px;font-size:50px;border:2px solid #dde' bgcolor=#" +
(((x+y) & 1) ? "c0c0f0>" : "f0f0f0>");
}
a += "</tr>";
}
a += "<tr><th colspan=8><select id=t style='font-size:20px'>";
a += "<option>♛<option>♜<option>♝<option>♞";
a += "</select></tr></table>";
document.write(a);
}
function debug()
{
console.log("board: " + board);
console.log("cpc: " + curPieceCode);
console.log("cp: " + curPlayer);
console.log("p2sm: " + pawn2SquareMove);
console.log("mf: " + moveFrom);
console.log("mt: " + moveTo);
}
function DrawPieces() {
debug();
var pieces = "\xa0\u265f\u265a\u265e\u265d\u265c\u265b \u2659\u2654\u2658\u2657\u2656\u2655";
var p, q;
moveFrom=moveTo;
for (p=21; p<99; ++p) {
if (q = document.getElementById("o" + p)) {
q.innerHTML = pieces.charAt(board[p] & 15);
q.style.borderColor = (p == moveFrom) ? "red" : "#dde";
}
}
}
function triggerAI()
{
console.log('triggerAI begin');
compute(0,0,0,21,pawn2SquareMove,2); // 2 = ply
compute(0,0,0,21,pawn2SquareMove,1);
clickLock=false;
console.log('triggerAI end');
}
var clickLock = false;
function OnClick(fieldID) {
if (clickLock)
return;
curPieceCode = (board[fieldID] ^ curPlayer) & C15;
if (curPieceCode > 8) {
// clicked on the own piece
moveTo = fieldID;
DrawPieces();
} else if (moveFrom && curPieceCode<9) {
// clicked on the opponent piece or empty space
moveTo = fieldID;
curPieceCode = board[moveFrom] & C15;
// pawn promotion
if ((curPieceCode & 7) == 1 & (moveTo < 29 | moveTo > 90))
curPieceCode = 14 - document.getElementById("t").selectedIndex ^ curPlayer;
// verify player move and execute it
compute(0,0,0,21,pawn2SquareMove,1);
// Call A.I. after some delay
if (curPlayer) {
clickLock = true;
setTimeout(triggerAI,250);
}
}
}
SetupChessboard();
CreateChessboardView();
DrawPieces();
curPieceCode = 100;
</script>