projects / vchess.git / blob
? search:


6bc3591cfc601c3604a4f7c7f7f0619db8c5b553
[vchess.git] / public / javascripts / base_rules.js
1 class PiPo //Piece+Position
2 {
3 // o: {piece[p], color[c], posX[x], posY[y]}
4 constructor(o)
5 {
6 this.p = o.p;
7 this.c = o.c;
8 this.x = o.x;
9 this.y = o.y;
10 }
11 }
12
13 class Move
14 {
15 // o: {appear, vanish, [start,] [end,]}
16 // appear,vanish = arrays of PiPo
17 // start,end = coordinates to apply to trigger move visually (think castle)
18 constructor(o)
19 {
20 this.appear = o.appear;
21 this.vanish = o.vanish;
22 this.start = !!o.start ? o.start : {x:o.vanish[0].x, y:o.vanish[0].y};
23 this.end = !!o.end ? o.end : {x:o.appear[0].x, y:o.appear[0].y};
24 }
25 }
26
27 // NOTE: x coords = top to bottom; y = left to right (from white player perspective)
28 class ChessRules
29 {
30 // Path to pieces
31 static getPpath(b)
32 {
33 return b; //usual pieces in pieces/ folder
34 }
35 // Turn "wb" into "B" (for FEN)
36 static board2fen(b)
37 {
38 return b[0]=='w' ? b[1].toUpperCase() : b[1];
39 }
40 // Turn "p" into "bp" (for board)
41 static fen2board(f)
42 {
43 return f.charCodeAt()<=90 ? "w"+f.toLowerCase() : "b"+f;
44 }
45
46 /////////////////
47 // INITIALIZATION
48
49 // fen == "position flags"
50 constructor(fen, moves)
51 {
52 this.moves = moves;
53 // Use fen string to initialize variables, flags and board
54 this.board = VariantRules.GetBoard(fen);
55 this.setFlags(fen);
56 this.initVariables(fen);
57 }
58
59 initVariables(fen)
60 {
61 this.INIT_COL_KING = {'w':-1, 'b':-1};
62 this.INIT_COL_ROOK = {'w':[-1,-1], 'b':[-1,-1]};
63 this.kingPos = {'w':[-1,-1], 'b':[-1,-1]}; //respective squares of white and black king
64 const fenParts = fen.split(" ");
65 const position = fenParts[0].split("/");
66 for (let i=0; i<position.length; i++)
67 {
68 let k = 0; //column index on board
69 for (let j=0; j<position[i].length; j++)
70 {
71 switch (position[i].charAt(j))
72 {
73 case 'k':
74 this.kingPos['b'] = [i,k];
75 this.INIT_COL_KING['b'] = k;
76 break;
77 case 'K':
78 this.kingPos['w'] = [i,k];
79 this.INIT_COL_KING['w'] = k;
80 break;
81 case 'r':
82 if (this.INIT_COL_ROOK['b'][0] < 0)
83 this.INIT_COL_ROOK['b'][0] = k;
84 else
85 this.INIT_COL_ROOK['b'][1] = k;
86 break;
87 case 'R':
88 if (this.INIT_COL_ROOK['w'][0] < 0)
89 this.INIT_COL_ROOK['w'][0] = k;
90 else
91 this.INIT_COL_ROOK['w'][1] = k;
92 break;
93 default:
94 let num = parseInt(position[i].charAt(j));
95 if (!isNaN(num))
96 k += (num-1);
97 }
98 k++;
99 }
100 }
101 const epSq = this.moves.length > 0 ? this.getEpSquare(this.lastMove) : undefined;
102 this.epSquares = [ epSq ];
103 }
104
105 // Turn diagram fen into double array ["wb","wp","bk",...]
106 static GetBoard(fen)
107 {
108 let rows = fen.split(" ")[0].split("/");
109 const [sizeX,sizeY] = VariantRules.size;
110 let board = doubleArray(sizeX, sizeY, "");
111 for (let i=0; i<rows.length; i++)
112 {
113 let j = 0;
114 for (let indexInRow = 0; indexInRow < rows[i].length; indexInRow++)
115 {
116 let character = rows[i][indexInRow];
117 let num = parseInt(character);
118 if (!isNaN(num))
119 j += num; //just shift j
120 else //something at position i,j
121 board[i][j++] = VariantRules.fen2board(character);
122 }
123 }
124 return board;
125 }
126
127 // Overridable: flags can change a lot
128 setFlags(fen)
129 {
130 // white a-castle, h-castle, black a-castle, h-castle
131 this.castleFlags = {'w': new Array(2), 'b': new Array(2)};
132 let flags = fen.split(" ")[1]; //flags right after position
133 for (let i=0; i<4; i++)
134 this.castleFlags[i < 2 ? 'w' : 'b'][i%2] = (flags.charAt(i) == '1');
135 }
136
137 ///////////////////
138 // GETTERS, SETTERS
139
140 // Simple useful getters
141 static get size() { return [8,8]; }
142 // Two next functions return 'undefined' if called on empty square
143 getColor(i,j) { return this.board[i][j].charAt(0); }
144 getPiece(i,j) { return this.board[i][j].charAt(1); }
145
146 // Color
147 getOppCol(color) { return color=="w" ? "b" : "w"; }
148
149 get lastMove() {
150 const L = this.moves.length;
151 return L>0 ? this.moves[L-1] : null;
152 }
153 get turn() {
154 return this.moves.length%2==0 ? 'w' : 'b';
155 }
156
157 // Pieces codes
158 static get PAWN() { return 'p'; }
159 static get ROOK() { return 'r'; }
160 static get KNIGHT() { return 'n'; }
161 static get BISHOP() { return 'b'; }
162 static get QUEEN() { return 'q'; }
163 static get KING() { return 'k'; }
164
165 // Empty square
166 static get EMPTY() { return ''; }
167
168 // Some pieces movements
169 static get steps() {
170 return {
171 'r': [ [-1,0],[1,0],[0,-1],[0,1] ],
172 'n': [ [-1,-2],[-1,2],[1,-2],[1,2],[-2,-1],[-2,1],[2,-1],[2,1] ],
173 'b': [ [-1,-1],[-1,1],[1,-1],[1,1] ],
174 };
175 }
176
177 // Aggregates flags into one object
178 get flags() {
179 return this.castleFlags;
180 }
181
182 // Reverse operation
183 parseFlags(flags)
184 {
185 this.castleFlags = flags;
186 }
187
188 // En-passant square, if any
189 getEpSquare(move)
190 {
191 const [sx,sy,ex] = [move.start.x,move.start.y,move.end.x];
192 if (this.getPiece(sx,sy) == VariantRules.PAWN && Math.abs(sx - ex) == 2)
193 {
194 return {
195 x: (sx + ex)/2,
196 y: sy
197 };
198 }
199 return undefined; //default
200 }
201
202 // can thing on square1 take thing on square2
203 canTake([x1,y1], [x2,y2])
204 {
205 return this.getColor(x1,y1) != this.getColor(x2,y2);
206 }
207
208 ///////////////////
209 // MOVES GENERATION
210
211 // All possible moves from selected square (assumption: color is OK)
212 getPotentialMovesFrom([x,y])
213 {
214 switch (this.getPiece(x,y))
215 {
216 case VariantRules.PAWN:
217 return this.getPotentialPawnMoves([x,y]);
218 case VariantRules.ROOK:
219 return this.getPotentialRookMoves([x,y]);
220 case VariantRules.KNIGHT:
221 return this.getPotentialKnightMoves([x,y]);
222 case VariantRules.BISHOP:
223 return this.getPotentialBishopMoves([x,y]);
224 case VariantRules.QUEEN:
225 return this.getPotentialQueenMoves([x,y]);
226 case VariantRules.KING:
227 return this.getPotentialKingMoves([x,y]);
228 }
229 }
230
231 // Build a regular move from its initial and destination squares; tr: transformation
232 getBasicMove([sx,sy], [ex,ey], tr)
233 {
234 let mv = new Move({
235 appear: [
236 new PiPo({
237 x: ex,
238 y: ey,
239 c: !!tr ? tr.c : this.getColor(sx,sy),
240 p: !!tr ? tr.p : this.getPiece(sx,sy)
241 })
242 ],
243 vanish: [
244 new PiPo({
245 x: sx,
246 y: sy,
247 c: this.getColor(sx,sy),
248 p: this.getPiece(sx,sy)
249 })
250 ]
251 });
252
253 // The opponent piece disappears if we take it
254 if (this.board[ex][ey] != VariantRules.EMPTY)
255 {
256 mv.vanish.push(
257 new PiPo({
258 x: ex,
259 y: ey,
260 c: this.getColor(ex,ey),
261 p: this.getPiece(ex,ey)
262 })
263 );
264 }
265 return mv;
266 }
267
268 // Generic method to find possible moves of non-pawn pieces ("sliding or jumping")
269 getSlideNJumpMoves([x,y], steps, oneStep)
270 {
271 const color = this.getColor(x,y);
272 let moves = [];
273 const [sizeX,sizeY] = VariantRules.size;
274 outerLoop:
275 for (let step of steps)
276 {
277 let i = x + step[0];
278 let j = y + step[1];
279 while (i>=0 && i<sizeX && j>=0 && j<sizeY
280 && this.board[i][j] == VariantRules.EMPTY)
281 {
282 moves.push(this.getBasicMove([x,y], [i,j]));
283 if (oneStep !== undefined)
284 continue outerLoop;
285 i += step[0];
286 j += step[1];
287 }
288 if (i>=0 && i<sizeX && j>=0 && j<sizeY && this.canTake([x,y], [i,j]))
289 moves.push(this.getBasicMove([x,y], [i,j]));
290 }
291 return moves;
292 }
293
294 // What are the pawn moves from square x,y considering color "color" ?
295 getPotentialPawnMoves([x,y])
296 {
297 const color = this.turn;
298 let moves = [];
299 const V = VariantRules;
300 const [sizeX,sizeY] = V.size;
301 const shift = (color == "w" ? -1 : 1);
302 const firstRank = (color == 'w' ? sizeX-1 : 0);
303 const startRank = (color == "w" ? sizeX-2 : 1);
304 const lastRank = (color == "w" ? 0 : sizeX-1);
305
306 if (x+shift >= 0 && x+shift < sizeX && x+shift != lastRank)
307 {
308 // Normal moves
309 if (this.board[x+shift][y] == V.EMPTY)
310 {
311 moves.push(this.getBasicMove([x,y], [x+shift,y]));
312 // Next condition because variants with pawns on 1st rank allow them to jump
313 if ([startRank,firstRank].includes(x) && this.board[x+2*shift][y] == V.EMPTY)
314 {
315 // Two squares jump
316 moves.push(this.getBasicMove([x,y], [x+2*shift,y]));
317 }
318 }
319 // Captures
320 if (y>0 && this.canTake([x,y], [x+shift,y-1])
321 && this.board[x+shift][y-1] != V.EMPTY)
322 {
323 moves.push(this.getBasicMove([x,y], [x+shift,y-1]));
324 }
325 if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
326 && this.board[x+shift][y+1] != V.EMPTY)
327 {
328 moves.push(this.getBasicMove([x,y], [x+shift,y+1]));
329 }
330 }
331
332 if (x+shift == lastRank)
333 {
334 // Promotion
335 let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN];
336 promotionPieces.forEach(p => {
337 // Normal move
338 if (this.board[x+shift][y] == V.EMPTY)
339 moves.push(this.getBasicMove([x,y], [x+shift,y], {c:color,p:p}));
340 // Captures
341 if (y>0 && this.canTake([x,y], [x+shift,y-1])
342 && this.board[x+shift][y-1] != V.EMPTY)
343 {
344 moves.push(this.getBasicMove([x,y], [x+shift,y-1], {c:color,p:p}));
345 }
346 if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
347 && this.board[x+shift][y+1] != V.EMPTY)
348 {
349 moves.push(this.getBasicMove([x,y], [x+shift,y+1], {c:color,p:p}));
350 }
351 });
352 }
353
354 // En passant
355 const Lep = this.epSquares.length;
356 const epSquare = Lep>0 ? this.epSquares[Lep-1] : undefined;
357 if (!!epSquare && epSquare.x == x+shift && Math.abs(epSquare.y - y) == 1)
358 {
359 let epStep = epSquare.y - y;
360 var enpassantMove = this.getBasicMove([x,y], [x+shift,y+epStep]);
361 enpassantMove.vanish.push({
362 x: x,
363 y: y+epStep,
364 p: 'p',
365 c: this.getColor(x,y+epStep)
366 });
367 moves.push(enpassantMove);
368 }
369
370 return moves;
371 }
372
373 // What are the rook moves from square x,y ?
374 getPotentialRookMoves(sq)
375 {
376 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.ROOK]);
377 }
378
379 // What are the knight moves from square x,y ?
380 getPotentialKnightMoves(sq)
381 {
382 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.KNIGHT], "oneStep");
383 }
384
385 // What are the bishop moves from square x,y ?
386 getPotentialBishopMoves(sq)
387 {
388 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.BISHOP]);
389 }
390
391 // What are the queen moves from square x,y ?
392 getPotentialQueenMoves(sq)
393 {
394 const V = VariantRules;
395 return this.getSlideNJumpMoves(sq, V.steps[V.ROOK].concat(V.steps[V.BISHOP]));
396 }
397
398 // What are the king moves from square x,y ?
399 getPotentialKingMoves(sq)
400 {
401 const V = VariantRules;
402 // Initialize with normal moves
403 let moves = this.getSlideNJumpMoves(sq,
404 V.steps[V.ROOK].concat(V.steps[V.BISHOP]), "oneStep");
405 return moves.concat(this.getCastleMoves(sq));
406 }
407
408 getCastleMoves([x,y])
409 {
410 const c = this.getColor(x,y);
411 const [sizeX,sizeY] = VariantRules.size;
412 if (x != (c=="w" ? sizeX-1 : 0) || y != this.INIT_COL_KING[c])
413 return []; //x isn't first rank, or king has moved (shortcut)
414
415 const V = VariantRules;
416
417 // Castling ?
418 const oppCol = this.getOppCol(c);
419 let moves = [];
420 let i = 0;
421 const finalSquares = [ [2,3], [sizeY-2,sizeY-3] ]; //king, then rook
422 castlingCheck:
423 for (let castleSide=0; castleSide < 2; castleSide++) //large, then small
424 {
425 if (!this.castleFlags[c][castleSide])
426 continue;
427 // If this code is reached, rooks and king are on initial position
428
429 // Nothing on the path of the king (and no checks; OK also if y==finalSquare)?
430 let step = finalSquares[castleSide][0] < y ? -1 : 1;
431 for (i=y; i!=finalSquares[castleSide][0]; i+=step)
432 {
433 if (this.isAttacked([x,i], [oppCol]) || (this.board[x][i] != V.EMPTY &&
434 // NOTE: next check is enough, because of chessboard constraints
435 (this.getColor(x,i) != c || ![V.KING,V.ROOK].includes(this.getPiece(x,i)))))
436 {
437 continue castlingCheck;
438 }
439 }
440
441 // Nothing on the path to the rook?
442 step = castleSide == 0 ? -1 : 1;
443 for (i = y + step; i != this.INIT_COL_ROOK[c][castleSide]; i += step)
444 {
445 if (this.board[x][i] != V.EMPTY)
446 continue castlingCheck;
447 }
448 const rookPos = this.INIT_COL_ROOK[c][castleSide];
449
450 // Nothing on final squares, except maybe king and castling rook?
451 for (i=0; i<2; i++)
452 {
453 if (this.board[x][finalSquares[castleSide][i]] != V.EMPTY &&
454 this.getPiece(x,finalSquares[castleSide][i]) != V.KING &&
455 finalSquares[castleSide][i] != rookPos)
456 {
457 continue castlingCheck;
458 }
459 }
460
461 // If this code is reached, castle is valid
462 moves.push( new Move({
463 appear: [
464 new PiPo({x:x,y:finalSquares[castleSide][0],p:V.KING,c:c}),
465 new PiPo({x:x,y:finalSquares[castleSide][1],p:V.ROOK,c:c})],
466 vanish: [
467 new PiPo({x:x,y:y,p:V.KING,c:c}),
468 new PiPo({x:x,y:rookPos,p:V.ROOK,c:c})],
469 end: Math.abs(y - rookPos) <= 2
470 ? {x:x, y:rookPos}
471 : {x:x, y:y + 2 * (castleSide==0 ? -1 : 1)}
472 }) );
473 }
474
475 return moves;
476 }
477
478 ///////////////////
479 // MOVES VALIDATION
480
481 canIplay(side, [x,y])
482 {
483 return ((side=='w' && this.moves.length%2==0) || (side=='b' && this.moves.length%2==1))
484 && this.getColor(x,y) == side;
485 }
486
487 getPossibleMovesFrom(sq)
488 {
489 // Assuming color is right (already checked)
490 return this.filterValid( this.getPotentialMovesFrom(sq) );
491 }
492
493 // TODO: once a promotion is filtered, the others results are same: useless computations
494 filterValid(moves)
495 {
496 if (moves.length == 0)
497 return [];
498 return moves.filter(m => { return !this.underCheck(m); });
499 }
500
501 // Search for all valid moves considering current turn (for engine and game end)
502 getAllValidMoves()
503 {
504 const color = this.turn;
505 const oppCol = this.getOppCol(color);
506 let potentialMoves = [];
507 const [sizeX,sizeY] = VariantRules.size;
508 for (let i=0; i<sizeX; i++)
509 {
510 for (let j=0; j<sizeY; j++)
511 {
512 // Next condition ... != oppCol is a little HACK to work with checkered variant
513 if (this.board[i][j] != VariantRules.EMPTY && this.getColor(i,j) != oppCol)
514 Array.prototype.push.apply(potentialMoves, this.getPotentialMovesFrom([i,j]));
515 }
516 }
517 // NOTE: prefer lazy undercheck tests, letting the king being taken?
518 // No: if happen on last 1/2 move, could lead to forbidden moves, wrong evals
519 return this.filterValid(potentialMoves);
520 }
521
522 // Stop at the first move found
523 atLeastOneMove()
524 {
525 const color = this.turn;
526 const oppCol = this.getOppCol(color);
527 const [sizeX,sizeY] = VariantRules.size;
528 for (let i=0; i<sizeX; i++)
529 {
530 for (let j=0; j<sizeY; j++)
531 {
532 if (this.board[i][j] != VariantRules.EMPTY && this.getColor(i,j) != oppCol)
533 {
534 const moves = this.getPotentialMovesFrom([i,j]);
535 if (moves.length > 0)
536 {
537 for (let k=0; k<moves.length; k++)
538 {
539 if (this.filterValid([moves[k]]).length > 0)
540 return true;
541 }
542 }
543 }
544 }
545 }
546 return false;
547 }
548
549 // Check if pieces of color 'colors' are attacking square x,y
550 isAttacked(sq, colors)
551 {
552 return (this.isAttackedByPawn(sq, colors)
553 || this.isAttackedByRook(sq, colors)
554 || this.isAttackedByKnight(sq, colors)
555 || this.isAttackedByBishop(sq, colors)
556 || this.isAttackedByQueen(sq, colors)
557 || this.isAttackedByKing(sq, colors));
558 }
559
560 // Is square x,y attacked by pawns of color c ?
561 isAttackedByPawn([x,y], colors)
562 {
563 const [sizeX,sizeY] = VariantRules.size;
564 for (let c of colors)
565 {
566 let pawnShift = (c=="w" ? 1 : -1);
567 if (x+pawnShift>=0 && x+pawnShift<sizeX)
568 {
569 for (let i of [-1,1])
570 {
571 if (y+i>=0 && y+i<sizeY && this.getPiece(x+pawnShift,y+i)==VariantRules.PAWN
572 && this.getColor(x+pawnShift,y+i)==c)
573 {
574 return true;
575 }
576 }
577 }
578 }
579 return false;
580 }
581
582 // Is square x,y attacked by rooks of color c ?
583 isAttackedByRook(sq, colors)
584 {
585 return this.isAttackedBySlideNJump(sq, colors,
586 VariantRules.ROOK, VariantRules.steps[VariantRules.ROOK]);
587 }
588
589 // Is square x,y attacked by knights of color c ?
590 isAttackedByKnight(sq, colors)
591 {
592 return this.isAttackedBySlideNJump(sq, colors,
593 VariantRules.KNIGHT, VariantRules.steps[VariantRules.KNIGHT], "oneStep");
594 }
595
596 // Is square x,y attacked by bishops of color c ?
597 isAttackedByBishop(sq, colors)
598 {
599 return this.isAttackedBySlideNJump(sq, colors,
600 VariantRules.BISHOP, VariantRules.steps[VariantRules.BISHOP]);
601 }
602
603 // Is square x,y attacked by queens of color c ?
604 isAttackedByQueen(sq, colors)
605 {
606 const V = VariantRules;
607 return this.isAttackedBySlideNJump(sq, colors, V.QUEEN,
608 V.steps[V.ROOK].concat(V.steps[V.BISHOP]));
609 }
610
611 // Is square x,y attacked by king of color c ?
612 isAttackedByKing(sq, colors)
613 {
614 const V = VariantRules;
615 return this.isAttackedBySlideNJump(sq, colors, V.KING,
616 V.steps[V.ROOK].concat(V.steps[V.BISHOP]), "oneStep");
617 }
618
619 // Generic method for non-pawn pieces ("sliding or jumping"):
620 // is x,y attacked by piece !of color in colors?
621 isAttackedBySlideNJump([x,y], colors, piece, steps, oneStep)
622 {
623 const [sizeX,sizeY] = VariantRules.size;
624 for (let step of steps)
625 {
626 let rx = x+step[0], ry = y+step[1];
627 while (rx>=0 && rx<sizeX && ry>=0 && ry<sizeY
628 && this.board[rx][ry] == VariantRules.EMPTY && !oneStep)
629 {
630 rx += step[0];
631 ry += step[1];
632 }
633 if (rx>=0 && rx<sizeX && ry>=0 && ry<sizeY
634 && this.board[rx][ry] != VariantRules.EMPTY
635 && this.getPiece(rx,ry) == piece && colors.includes(this.getColor(rx,ry)))
636 {
637 return true;
638 }
639 }
640 return false;
641 }
642
643 // Is color c under check after move ?
644 underCheck(move)
645 {
646 const color = this.turn;
647 this.play(move);
648 let res = this.isAttacked(this.kingPos[color], [this.getOppCol(color)]);
649 this.undo(move);
650 return res;
651 }
652
653 // On which squares is color c under check (after move) ?
654 getCheckSquares(move)
655 {
656 this.play(move);
657 const color = this.turn; //opponent
658 let res = this.isAttacked(this.kingPos[color], [this.getOppCol(color)])
659 ? [ JSON.parse(JSON.stringify(this.kingPos[color])) ] //need to duplicate!
660 : [ ];
661 this.undo(move);
662 return res;
663 }
664
665 // Apply a move on board
666 static PlayOnBoard(board, move)
667 {
668 for (let psq of move.vanish)
669 board[psq.x][psq.y] = VariantRules.EMPTY;
670 for (let psq of move.appear)
671 board[psq.x][psq.y] = psq.c + psq.p;
672 }
673 // Un-apply the played move
674 static UndoOnBoard(board, move)
675 {
676 for (let psq of move.appear)
677 board[psq.x][psq.y] = VariantRules.EMPTY;
678 for (let psq of move.vanish)
679 board[psq.x][psq.y] = psq.c + psq.p;
680 }
681
682 // Before move is played, update variables + flags
683 updateVariables(move)
684 {
685 const piece = this.getPiece(move.start.x,move.start.y);
686 const c = this.getColor(move.start.x,move.start.y);
687 const [sizeX,sizeY] = VariantRules.size;
688 const firstRank = (c == "w" ? sizeX-1 : 0);
689
690 // Update king position + flags
691 if (piece == VariantRules.KING && move.appear.length > 0)
692 {
693 this.kingPos[c][0] = move.appear[0].x;
694 this.kingPos[c][1] = move.appear[0].y;
695 this.castleFlags[c] = [false,false];
696 return;
697 }
698 const oppCol = this.getOppCol(c);
699 const oppFirstRank = (sizeX-1) - firstRank;
700 if (move.start.x == firstRank //our rook moves?
701 && this.INIT_COL_ROOK[c].includes(move.start.y))
702 {
703 const flagIdx = (move.start.y == this.INIT_COL_ROOK[c][0] ? 0 : 1);
704 this.castleFlags[c][flagIdx] = false;
705 }
706 else if (move.end.x == oppFirstRank //we took opponent rook?
707 && this.INIT_COL_ROOK[oppCol].includes(move.end.y))
708 {
709 const flagIdx = (move.end.y == this.INIT_COL_ROOK[oppCol][0] ? 0 : 1);
710 this.castleFlags[oppCol][flagIdx] = false;
711 }
712 }
713
714 unupdateVariables(move)
715 {
716 // (Potentially) Reset king position
717 const c = this.getColor(move.start.x,move.start.y);
718 if (this.getPiece(move.start.x,move.start.y) == VariantRules.KING)
719 this.kingPos[c] = [move.start.x, move.start.y];
720 }
721
722 play(move, ingame)
723 {
724 // DEBUG:
725 // if (!this.states) this.states = [];
726 // if (!ingame) this.states.push(JSON.stringify(this.board));
727 // if (!this.rstates) this.rstates = [];
728 // if (!ingame) this.rstates.push(JSON.stringify(this.promoted)+"-"+JSON.stringify(this.reserve));
729
730 if (!!ingame)
731 move.notation = [this.getNotation(move), this.getLongNotation(move)];
732
733 move.flags = JSON.stringify(this.flags); //save flags (for undo)
734 this.updateVariables(move);
735 this.moves.push(move);
736 this.epSquares.push( this.getEpSquare(move) );
737 VariantRules.PlayOnBoard(this.board, move);
738 }
739
740 undo(move)
741 {
742 VariantRules.UndoOnBoard(this.board, move);
743 this.epSquares.pop();
744 this.moves.pop();
745 this.unupdateVariables(move);
746 this.parseFlags(JSON.parse(move.flags));
747
748 // DEBUG:
749 // let state = this.states.pop();
750 // let rstate = this.rstates.pop();
751 // if (JSON.stringify(this.board) != state || JSON.stringify(this.promoted)+"-"+JSON.stringify(this.reserve) != rstate)
752 // debugger;
753 }
754
755 //////////////
756 // END OF GAME
757
758 checkRepetition()
759 {
760 // Check for 3 repetitions
761 if (this.moves.length >= 8)
762 {
763 // NOTE: crude detection, only moves repetition
764 const L = this.moves.length;
765 if (_.isEqual(this.moves[L-1], this.moves[L-5]) &&
766 _.isEqual(this.moves[L-2], this.moves[L-6]) &&
767 _.isEqual(this.moves[L-3], this.moves[L-7]) &&
768 _.isEqual(this.moves[L-4], this.moves[L-8]))
769 {
770 return true;
771 }
772 }
773 return false;
774 }
775
776 checkGameOver()
777 {
778 if (this.checkRepetition())
779 return "1/2";
780
781 if (this.atLeastOneMove()) // game not over
782 return "*";
783
784 // Game over
785 return this.checkGameEnd();
786 }
787
788 // No moves are possible: compute score
789 checkGameEnd()
790 {
791 const color = this.turn;
792 // No valid move: stalemate or checkmate?
793 if (!this.isAttacked(this.kingPos[color], [this.getOppCol(color)]))
794 return "1/2";
795 // OK, checkmate
796 return color == "w" ? "0-1" : "1-0";
797 }
798
799 ////////
800 //ENGINE
801
802 // Pieces values
803 static get VALUES() {
804 return {
805 'p': 1,
806 'r': 5,
807 'n': 3,
808 'b': 3,
809 'q': 9,
810 'k': 1000
811 };
812 }
813
814 static get INFINITY() {
815 return 9999; //"checkmate" (unreachable eval)
816 }
817
818 static get THRESHOLD_MATE() {
819 // At this value or above, the game is over
820 return VariantRules.INFINITY;
821 }
822
823 static get SEARCH_DEPTH() {
824 return 3; //2 for high branching factor, 4 for small (Loser chess)
825 }
826
827 // Assumption: at least one legal move
828 // NOTE: works also for extinction chess because depth is 3...
829 getComputerMove()
830 {
831 this.shouldReturn = false;
832 const maxeval = VariantRules.INFINITY;
833 const color = this.turn;
834 let moves1 = this.getAllValidMoves();
835
836 // Can I mate in 1 ? (for Magnetic & Extinction)
837 for (let i of _.shuffle(_.range(moves1.length)))
838 {
839 this.play(moves1[i]);
840 const finish = (Math.abs(this.evalPosition()) >= VariantRules.THRESHOLD_MATE);
841 this.undo(moves1[i]);
842 if (finish)
843 return moves1[i];
844 }
845
846 // Rank moves using a min-max at depth 2
847 for (let i=0; i<moves1.length; i++)
848 {
849 moves1[i].eval = (color=="w" ? -1 : 1) * maxeval; //very low, I'm checkmated
850 let eval2 = (color=="w" ? 1 : -1) * maxeval; //initialized with checkmate value
851 this.play(moves1[i]);
852 // Second half-move:
853 let moves2 = this.getAllValidMoves();
854 // If no possible moves AND underCheck, eval2 is correct.
855 // If !underCheck, eval2 is 0 (stalemate).
856 if (moves2.length == 0 && this.checkGameEnd() == "1/2")
857 eval2 = 0;
858 for (let j=0; j<moves2.length; j++)
859 {
860 this.play(moves2[j]);
861 let evalPos = this.evalPosition();
862 if ((color == "w" && evalPos < eval2) || (color=="b" && evalPos > eval2))
863 eval2 = evalPos;
864 this.undo(moves2[j]);
865 }
866 if ((color=="w" && eval2 > moves1[i].eval) || (color=="b" && eval2 < moves1[i].eval))
867 moves1[i].eval = eval2;
868 this.undo(moves1[i]);
869 }
870 moves1.sort( (a,b) => { return (color=="w" ? 1 : -1) * (b.eval - a.eval); });
871
872 let candidates = [0]; //indices of candidates moves
873 for (let j=1; j<moves1.length && moves1[j].eval == moves1[0].eval; j++)
874 candidates.push(j);
875 let currentBest = moves1[_.sample(candidates, 1)];
876
877 // Skip depth 3+ if we found a checkmate (or if we are checkmated in 1...)
878 if (VariantRules.SEARCH_DEPTH >= 3
879 && Math.abs(moves1[0].eval) < VariantRules.THRESHOLD_MATE)
880 {
881 for (let i=0; i<moves1.length; i++)
882 {
883 if (this.shouldReturn)
884 return currentBest; //depth-2, minimum
885 this.play(moves1[i]);
886 // 0.1 * oldEval : heuristic to avoid some bad moves (not all...)
887 moves1[i].eval = 0.1*moves1[i].eval +
888 this.alphabeta(VariantRules.SEARCH_DEPTH-1, -maxeval, maxeval);
889 this.undo(moves1[i]);
890 }
891 moves1.sort( (a,b) => { return (color=="w" ? 1 : -1) * (b.eval - a.eval); });
892 }
893 else
894 return currentBest;
895
896 candidates = [0];
897 for (let j=1; j<moves1.length && moves1[j].eval == moves1[0].eval; j++)
898 candidates.push(j);
899 // console.log(moves1.map(m => { return [this.getNotation(m), m.eval]; }));
900 return moves1[_.sample(candidates, 1)];
901 }
902
903 alphabeta(depth, alpha, beta)
904 {
905 const maxeval = VariantRules.INFINITY;
906 const color = this.turn;
907 if (!this.atLeastOneMove())
908 {
909 switch (this.checkGameEnd())
910 {
911 case "1/2": return 0;
912 default: return color=="w" ? -maxeval : maxeval;
913 }
914 }
915 if (depth == 0)
916 return this.evalPosition();
917 const moves = this.getAllValidMoves();
918 let v = color=="w" ? -maxeval : maxeval;
919 if (color == "w")
920 {
921 for (let i=0; i<moves.length; i++)
922 {
923 this.play(moves[i]);
924 v = Math.max(v, this.alphabeta(depth-1, alpha, beta));
925 this.undo(moves[i]);
926 alpha = Math.max(alpha, v);
927 if (alpha >= beta)
928 break; //beta cutoff
929 }
930 }
931 else //color=="b"
932 {
933 for (let i=0; i<moves.length; i++)
934 {
935 this.play(moves[i]);
936 v = Math.min(v, this.alphabeta(depth-1, alpha, beta));
937 this.undo(moves[i]);
938 beta = Math.min(beta, v);
939 if (alpha >= beta)
940 break; //alpha cutoff
941 }
942 }
943 return v;
944 }
945
946 evalPosition()
947 {
948 const [sizeX,sizeY] = VariantRules.size;
949 let evaluation = 0;
950 // Just count material for now
951 for (let i=0; i<sizeX; i++)
952 {
953 for (let j=0; j<sizeY; j++)
954 {
955 if (this.board[i][j] != VariantRules.EMPTY)
956 {
957 const sign = this.getColor(i,j) == "w" ? 1 : -1;
958 evaluation += sign * VariantRules.VALUES[this.getPiece(i,j)];
959 }
960 }
961 }
962 return evaluation;
963 }
964
965 ////////////
966 // FEN utils
967
968 // Overridable..
969 static GenRandInitFen()
970 {
971 let pieces = [new Array(8), new Array(8)];
972 // Shuffle pieces on first and last rank
973 for (let c = 0; c <= 1; c++)
974 {
975 let positions = _.range(8);
976
977 // Get random squares for bishops
978 let randIndex = 2 * _.random(3);
979 let bishop1Pos = positions[randIndex];
980 // The second bishop must be on a square of different color
981 let randIndex_tmp = 2 * _.random(3) + 1;
982 let bishop2Pos = positions[randIndex_tmp];
983 // Remove chosen squares
984 positions.splice(Math.max(randIndex,randIndex_tmp), 1);
985 positions.splice(Math.min(randIndex,randIndex_tmp), 1);
986
987 // Get random squares for knights
988 randIndex = _.random(5);
989 let knight1Pos = positions[randIndex];
990 positions.splice(randIndex, 1);
991 randIndex = _.random(4);
992 let knight2Pos = positions[randIndex];
993 positions.splice(randIndex, 1);
994
995 // Get random square for queen
996 randIndex = _.random(3);
997 let queenPos = positions[randIndex];
998 positions.splice(randIndex, 1);
999
1000 // Rooks and king positions are now fixed, because of the ordering rook-king-rook
1001 let rook1Pos = positions[0];
1002 let kingPos = positions[1];
1003 let rook2Pos = positions[2];
1004
1005 // Finally put the shuffled pieces in the board array
1006 pieces[c][rook1Pos] = 'r';
1007 pieces[c][knight1Pos] = 'n';
1008 pieces[c][bishop1Pos] = 'b';
1009 pieces[c][queenPos] = 'q';
1010 pieces[c][kingPos] = 'k';
1011 pieces[c][bishop2Pos] = 'b';
1012 pieces[c][knight2Pos] = 'n';
1013 pieces[c][rook2Pos] = 'r';
1014 }
1015 let fen = pieces[0].join("") +
1016 "/pppppppp/8/8/8/8/PPPPPPPP/" +
1017 pieces[1].join("").toUpperCase() +
1018 " 1111"; //add flags
1019 return fen;
1020 }
1021
1022 // Return current fen according to pieces+colors state
1023 getFen()
1024 {
1025 return this.getBaseFen() + " " + this.getFlagsFen();
1026 }
1027
1028 getBaseFen()
1029 {
1030 let fen = "";
1031 let [sizeX,sizeY] = VariantRules.size;
1032 for (let i=0; i<sizeX; i++)
1033 {
1034 let emptyCount = 0;
1035 for (let j=0; j<sizeY; j++)
1036 {
1037 if (this.board[i][j] == VariantRules.EMPTY)
1038 emptyCount++;
1039 else
1040 {
1041 if (emptyCount > 0)
1042 {
1043 // Add empty squares in-between
1044 fen += emptyCount;
1045 emptyCount = 0;
1046 }
1047 fen += VariantRules.board2fen(this.board[i][j]);
1048 }
1049 }
1050 if (emptyCount > 0)
1051 {
1052 // "Flush remainder"
1053 fen += emptyCount;
1054 }
1055 if (i < sizeX - 1)
1056 fen += "/"; //separate rows
1057 }
1058 return fen;
1059 }
1060
1061 // Overridable..
1062 getFlagsFen()
1063 {
1064 let fen = "";
1065 // Add castling flags
1066 for (let i of ['w','b'])
1067 {
1068 for (let j=0; j<2; j++)
1069 fen += this.castleFlags[i][j] ? '1' : '0';
1070 }
1071 return fen;
1072 }
1073
1074 // Context: just before move is played, turn hasn't changed
1075 getNotation(move)
1076 {
1077 if (move.appear.length == 2 && move.appear[0].p == VariantRules.KING)
1078 {
1079 // Castle
1080 if (move.end.y < move.start.y)
1081 return "0-0-0";
1082 else
1083 return "0-0";
1084 }
1085
1086 // Translate final square
1087 const finalSquare =
1088 String.fromCharCode(97 + move.end.y) + (VariantRules.size[0]-move.end.x);
1089
1090 const piece = this.getPiece(move.start.x, move.start.y);
1091 if (piece == VariantRules.PAWN)
1092 {
1093 // Pawn move
1094 let notation = "";
1095 if (move.vanish.length > move.appear.length)
1096 {
1097 // Capture
1098 const startColumn = String.fromCharCode(97 + move.start.y);
1099 notation = startColumn + "x" + finalSquare;
1100 }
1101 else //no capture
1102 notation = finalSquare;
1103 if (move.appear.length > 0 && piece != move.appear[0].p) //promotion
1104 notation += "=" + move.appear[0].p.toUpperCase();
1105 return notation;
1106 }
1107
1108 else
1109 {
1110 // Piece movement
1111 return piece.toUpperCase() +
1112 (move.vanish.length > move.appear.length ? "x" : "") + finalSquare;
1113 }
1114 }
1115
1116 // Complete the usual notation, may be required for de-ambiguification
1117 getLongNotation(move)
1118 {
1119 const startSquare =
1120 String.fromCharCode(97 + move.start.y) + (VariantRules.size[0]-move.start.x);
1121 const finalSquare =
1122 String.fromCharCode(97 + move.end.y) + (VariantRules.size[0]-move.end.x);
1123 return startSquare + finalSquare; //not encoding move. But short+long is enough
1124 }
1125
1126 // The score is already computed when calling this function
1127 getPGN(mycolor, score, fenStart, mode)
1128 {
1129 let pgn = "";
1130 pgn += '[Site "vchess.club"]<br>';
1131 const d = new Date();
1132 const opponent = mode=="human" ? "Anonymous" : "Computer";
1133 pgn += '[Variant "' + variant + '"]<br>';
1134 pgn += '[Date "' + d.getFullYear() + '-' + (d.getMonth()+1) + '-' + d.getDate() + '"]<br>';
1135 pgn += '[White "' + (mycolor=='w'?'Myself':opponent) + '"]<br>';
1136 pgn += '[Black "' + (mycolor=='b'?'Myself':opponent) + '"]<br>';
1137 pgn += '[Fen "' + fenStart + '"]<br>';
1138 pgn += '[Result "' + score + '"]<br><br>';
1139
1140 // Standard PGN
1141 for (let i=0; i<this.moves.length; i++)
1142 {
1143 if (i % 2 == 0)
1144 pgn += ((i/2)+1) + ".";
1145 pgn += this.moves[i].notation[0] + " ";
1146 }
1147 pgn += score + "<br><br>";
1148
1149 // "Complete moves" PGN (helping in ambiguous cases)
1150 for (let i=0; i<this.moves.length; i++)
1151 {
1152 if (i % 2 == 0)
1153 pgn += ((i/2)+1) + ".";
1154 pgn += this.moves[i].notation[1] + " ";
1155 }
1156 pgn += score;
1157
1158 return pgn;
1159 }
1160 }
Website to play original chess variants