projects / vchess.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Remove some redundant code [Checkered/Magnetic still buggish]
[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 'q': [ [-1,0],[1,0],[0,-1],[0,1],[-1,-1],[-1,1],[1,-1],[1,1] ]
175 };
176 }
177
178 // Aggregates flags into one object
179 get flags() {
180 return this.castleFlags;
181 }
182
183 // Reverse operation
184 parseFlags(flags)
185 {
186 this.castleFlags = flags;
187 }
188
189 // En-passant square, if any
190 getEpSquare(move)
191 {
192 const [sx,sy,ex] = [move.start.x,move.start.y,move.end.x];
193 if (this.getPiece(sx,sy) == VariantRules.PAWN && Math.abs(sx - ex) == 2)
194 {
195 return {
196 x: (sx + ex)/2,
197 y: sy
198 };
199 }
200 return undefined; //default
201 }
202
203 // can thing on square1 take thing on square2
204 canTake([x1,y1], [x2,y2])
205 {
206 return this.getColor(x1,y1) != this.getColor(x2,y2);
207 }
208
209 ///////////////////
210 // MOVES GENERATION
211
212 // All possible moves from selected square (assumption: color is OK)
213 getPotentialMovesFrom([x,y])
214 {
215 switch (this.getPiece(x,y))
216 {
217 case VariantRules.PAWN:
218 return this.getPotentialPawnMoves([x,y]);
219 case VariantRules.ROOK:
220 return this.getPotentialRookMoves([x,y]);
221 case VariantRules.KNIGHT:
222 return this.getPotentialKnightMoves([x,y]);
223 case VariantRules.BISHOP:
224 return this.getPotentialBishopMoves([x,y]);
225 case VariantRules.QUEEN:
226 return this.getPotentialQueenMoves([x,y]);
227 case VariantRules.KING:
228 return this.getPotentialKingMoves([x,y]);
229 }
230 }
231
232 // Build a regular move from its initial and destination squares; tr: transformation
233 getBasicMove([sx,sy], [ex,ey], tr)
234 {
235 let mv = new Move({
236 appear: [
237 new PiPo({
238 x: ex,
239 y: ey,
240 c: !!tr ? tr.c : this.getColor(sx,sy),
241 p: !!tr ? tr.p : this.getPiece(sx,sy)
242 })
243 ],
244 vanish: [
245 new PiPo({
246 x: sx,
247 y: sy,
248 c: this.getColor(sx,sy),
249 p: this.getPiece(sx,sy)
250 })
251 ]
252 });
253
254 // The opponent piece disappears if we take it
255 if (this.board[ex][ey] != VariantRules.EMPTY)
256 {
257 mv.vanish.push(
258 new PiPo({
259 x: ex,
260 y: ey,
261 c: this.getColor(ex,ey),
262 p: this.getPiece(ex,ey)
263 })
264 );
265 }
266 return mv;
267 }
268
269 // Generic method to find possible moves of non-pawn pieces ("sliding or jumping")
270 getSlideNJumpMoves([x,y], steps, oneStep)
271 {
272 const color = this.getColor(x,y);
273 let moves = [];
274 const [sizeX,sizeY] = VariantRules.size;
275 outerLoop:
276 for (let step of steps)
277 {
278 let i = x + step[0];
279 let j = y + step[1];
280 while (i>=0 && i<sizeX && j>=0 && j<sizeY && 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<8 && j>=0 && j<8 && 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] = VariantRules.size;
301 const shift = (color == "w" ? -1 : 1);
302 const firstRank = (color == 'w' ? sizeY-1 : 0);
303 const startRank = (color == "w" ? sizeY-2 : 1);
304 const lastRank = (color == "w" ? 0 : sizeY-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 generally 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]) && this.board[x+shift][y-1] != V.EMPTY)
321 moves.push(this.getBasicMove([x,y], [x+shift,y-1]));
322 if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1]) && this.board[x+shift][y+1] != V.EMPTY)
323 moves.push(this.getBasicMove([x,y], [x+shift,y+1]));
324 }
325
326 if (x+shift == lastRank)
327 {
328 // Promotion
329 let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN];
330 promotionPieces.forEach(p => {
331 // Normal move
332 if (this.board[x+shift][y] == V.EMPTY)
333 moves.push(this.getBasicMove([x,y], [x+shift,y], {c:color,p:p}));
334 // Captures
335 if (y>0 && this.canTake([x,y], [x+shift,y-1]) && this.board[x+shift][y-1] != V.EMPTY)
336 moves.push(this.getBasicMove([x,y], [x+shift,y-1], {c:color,p:p}));
337 if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1]) && this.board[x+shift][y+1] != V.EMPTY)
338 moves.push(this.getBasicMove([x,y], [x+shift,y+1], {c:color,p:p}));
339 });
340 }
341
342 // En passant
343 const Lep = this.epSquares.length;
344 const epSquare = Lep>0 ? this.epSquares[Lep-1] : undefined;
345 if (!!epSquare && epSquare.x == x+shift && Math.abs(epSquare.y - y) == 1)
346 {
347 let epStep = epSquare.y - y;
348 var enpassantMove = this.getBasicMove([x,y], [x+shift,y+epStep]);
349 enpassantMove.vanish.push({
350 x: x,
351 y: y+epStep,
352 p: 'p',
353 c: this.getColor(x,y+epStep)
354 });
355 moves.push(enpassantMove);
356 }
357
358 return moves;
359 }
360
361 // What are the rook moves from square x,y ?
362 getPotentialRookMoves(sq)
363 {
364 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.ROOK]);
365 }
366
367 // What are the knight moves from square x,y ?
368 getPotentialKnightMoves(sq)
369 {
370 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.KNIGHT], "oneStep");
371 }
372
373 // What are the bishop moves from square x,y ?
374 getPotentialBishopMoves(sq)
375 {
376 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.BISHOP]);
377 }
378
379 // What are the queen moves from square x,y ?
380 getPotentialQueenMoves(sq)
381 {
382 return this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.QUEEN]);
383 }
384
385 // What are the king moves from square x,y ?
386 getPotentialKingMoves(sq)
387 {
388 // Initialize with normal moves
389 let moves = this.getSlideNJumpMoves(sq, VariantRules.steps[VariantRules.QUEEN], "oneStep");
390 return moves.concat(this.getCastleMoves(sq));
391 }
392
393 getCastleMoves([x,y])
394 {
395 const c = this.getColor(x,y);
396 if (x != (c=="w" ? 7 : 0) || y != this.INIT_COL_KING[c])
397 return []; //x isn't first rank, or king has moved (shortcut)
398
399 const V = VariantRules;
400
401 // Castling ?
402 const oppCol = this.getOppCol(c);
403 let moves = [];
404 let i = 0;
405 const finalSquares = [ [2,3], [6,5] ]; //king, then rook
406 castlingCheck:
407 for (let castleSide=0; castleSide < 2; castleSide++) //large, then small
408 {
409 if (!this.castleFlags[c][castleSide])
410 continue;
411 // If this code is reached, rooks and king are on initial position
412
413 // Nothing on the path of the king (and no checks; OK also if y==finalSquare)?
414 let step = finalSquares[castleSide][0] < y ? -1 : 1;
415 for (i=y; i!=finalSquares[castleSide][0]; i+=step)
416 {
417 if (this.isAttacked([x,i], oppCol) || (this.board[x][i] != V.EMPTY &&
418 // NOTE: next check is enough, because of chessboard constraints
419 (this.getColor(x,i) != c || ![V.KING,V.ROOK].includes(this.getPiece(x,i)))))
420 {
421 continue castlingCheck;
422 }
423 }
424
425 // Nothing on the path to the rook?
426 step = castleSide == 0 ? -1 : 1;
427 for (i = y + step; i != this.INIT_COL_ROOK[c][castleSide]; i += step)
428 {
429 if (this.board[x][i] != V.EMPTY)
430 continue castlingCheck;
431 }
432 const rookPos = this.INIT_COL_ROOK[c][castleSide];
433
434 // Nothing on final squares, except maybe king and castling rook?
435 for (i=0; i<2; i++)
436 {
437 if (this.board[x][finalSquares[castleSide][i]] != V.EMPTY &&
438 this.getPiece(x,finalSquares[castleSide][i]) != V.KING &&
439 finalSquares[castleSide][i] != rookPos)
440 {
441 continue castlingCheck;
442 }
443 }
444
445 // If this code is reached, castle is valid
446 moves.push( new Move({
447 appear: [
448 new PiPo({x:x,y:finalSquares[castleSide][0],p:V.KING,c:c}),
449 new PiPo({x:x,y:finalSquares[castleSide][1],p:V.ROOK,c:c})],
450 vanish: [
451 new PiPo({x:x,y:y,p:V.KING,c:c}),
452 new PiPo({x:x,y:rookPos,p:V.ROOK,c:c})],
453 end: Math.abs(y - rookPos) <= 2
454 ? {x:x, y:rookPos}
455 : {x:x, y:y + 2 * (castleSide==0 ? -1 : 1)}
456 }) );
457 }
458
459 return moves;
460 }
461
462 ///////////////////
463 // MOVES VALIDATION
464
465 canIplay(side, [x,y])
466 {
467 return ((side=='w' && this.moves.length%2==0) || (side=='b' && this.moves.length%2==1))
468 && this.getColor(x,y) == side;
469 }
470
471 getPossibleMovesFrom(sq)
472 {
473 // Assuming color is right (already checked)
474 return this.filterValid( this.getPotentialMovesFrom(sq) );
475 }
476
477 // TODO: once a promotion is filtered, the others results are same: useless computations
478 filterValid(moves)
479 {
480 if (moves.length == 0)
481 return [];
482 let color = this.turn;
483 return moves.filter(m => { return !this.underCheck(m, color); });
484 }
485
486 // Search for all valid moves considering current turn (for engine and game end)
487 getAllValidMoves()
488 {
489 const color = this.turn;
490 const oppCol = this.getOppCol(color);
491 var potentialMoves = [];
492 let [sizeX,sizeY] = VariantRules.size;
493 for (var i=0; i<sizeX; i++)
494 {
495 for (var j=0; j<sizeY; j++)
496 {
497 // Next condition ... != oppCol is a little HACK to work with checkered variant
498 if (this.board[i][j] != VariantRules.EMPTY && this.getColor(i,j) != oppCol)
499 Array.prototype.push.apply(potentialMoves, this.getPotentialMovesFrom([i,j]));
500 }
501 }
502 // NOTE: prefer lazy undercheck tests, letting the king being taken?
503 // No: if happen on last 1/2 move, could lead to forbidden moves, wrong evals
504 return this.filterValid(potentialMoves);
505 }
506
507 // Stop at the first move found
508 atLeastOneMove()
509 {
510 const color = this.turn;
511 const oppCol = this.getOppCol(color);
512 let [sizeX,sizeY] = VariantRules.size;
513 for (var i=0; i<sizeX; i++)
514 {
515 for (var j=0; j<sizeY; j++)
516 {
517 if (this.board[i][j] != VariantRules.EMPTY && this.getColor(i,j) != oppCol)
518 {
519 const moves = this.getPotentialMovesFrom([i,j]);
520 if (moves.length > 0)
521 {
522 for (let i=0; i<moves.length; i++)
523 {
524 if (this.filterValid([moves[i]]).length > 0)
525 return true;
526 }
527 }
528 }
529 }
530 }
531 return false;
532 }
533
534 // Check if pieces of color 'colors' are attacking square x,y
535 isAttacked(sq, colors)
536 {
537 return (this.isAttackedByPawn(sq, colors)
538 || this.isAttackedByRook(sq, colors)
539 || this.isAttackedByKnight(sq, colors)
540 || this.isAttackedByBishop(sq, colors)
541 || this.isAttackedByQueen(sq, colors)
542 || this.isAttackedByKing(sq, colors));
543 }
544
545 // Is square x,y attacked by pawns of color c ?
546 isAttackedByPawn([x,y], colors)
547 {
548 for (let c of colors)
549 {
550 let pawnShift = (c=="w" ? 1 : -1);
551 if (x+pawnShift>=0 && x+pawnShift<8)
552 {
553 for (let i of [-1,1])
554 {
555 if (y+i>=0 && y+i<8 && this.getPiece(x+pawnShift,y+i)==VariantRules.PAWN
556 && this.getColor(x+pawnShift,y+i)==c)
557 {
558 return true;
559 }
560 }
561 }
562 }
563 return false;
564 }
565
566 // Is square x,y attacked by rooks of color c ?
567 isAttackedByRook(sq, colors)
568 {
569 return this.isAttackedBySlideNJump(sq, colors,
570 VariantRules.ROOK, VariantRules.steps[VariantRules.ROOK]);
571 }
572
573 // Is square x,y attacked by knights of color c ?
574 isAttackedByKnight(sq, colors)
575 {
576 return this.isAttackedBySlideNJump(sq, colors,
577 VariantRules.KNIGHT, VariantRules.steps[VariantRules.KNIGHT], "oneStep");
578 }
579
580 // Is square x,y attacked by bishops of color c ?
581 isAttackedByBishop(sq, colors)
582 {
583 return this.isAttackedBySlideNJump(sq, colors,
584 VariantRules.BISHOP, VariantRules.steps[VariantRules.BISHOP]);
585 }
586
587 // Is square x,y attacked by queens of color c ?
588 isAttackedByQueen(sq, colors)
589 {
590 return this.isAttackedBySlideNJump(sq, colors,
591 VariantRules.QUEEN, VariantRules.steps[VariantRules.QUEEN]);
592 }
593
594 // Is square x,y attacked by king of color c ?
595 isAttackedByKing(sq, colors)
596 {
597 return this.isAttackedBySlideNJump(sq, colors,
598 VariantRules.KING, VariantRules.steps[VariantRules.QUEEN], "oneStep");
599 }
600
601 // Generic method for non-pawn pieces ("sliding or jumping"): is x,y attacked by piece != color ?
602 isAttackedBySlideNJump([x,y], colors, piece, steps, oneStep)
603 {
604 for (let step of steps)
605 {
606 let rx = x+step[0], ry = y+step[1];
607 while (rx>=0 && rx<8 && ry>=0 && ry<8 && this.board[rx][ry] == VariantRules.EMPTY
608 && !oneStep)
609 {
610 rx += step[0];
611 ry += step[1];
612 }
613 if (rx>=0 && rx<8 && ry>=0 && ry<8 && this.board[rx][ry] != VariantRules.EMPTY
614 && this.getPiece(rx,ry) == piece && colors.includes(this.getColor(rx,ry)))
615 {
616 return true;
617 }
618 }
619 return false;
620 }
621
622 // Is color c under check after move ?
623 underCheck(move)
624 {
625 const color = this.turn;
626 this.play(move);
627 let res = this.isAttacked(this.kingPos[color], this.getOppCol(color));
628 this.undo(move);
629 return res;
630 }
631
632 // On which squares is color c under check (after move) ?
633 getCheckSquares(move)
634 {
635 this.play(move);
636 const color = this.turn; //opponent
637 let res = this.isAttacked(this.kingPos[color], this.getOppCol(color))
638 ? [ JSON.parse(JSON.stringify(this.kingPos[color])) ] //need to duplicate!
639 : [ ];
640 this.undo(move);
641 return res;
642 }
643
644 // Apply a move on board
645 static PlayOnBoard(board, move)
646 {
647 for (let psq of move.vanish)
648 board[psq.x][psq.y] = VariantRules.EMPTY;
649 for (let psq of move.appear)
650 board[psq.x][psq.y] = psq.c + psq.p;
651 }
652 // Un-apply the played move
653 static UndoOnBoard(board, move)
654 {
655 for (let psq of move.appear)
656 board[psq.x][psq.y] = VariantRules.EMPTY;
657 for (let psq of move.vanish)
658 board[psq.x][psq.y] = psq.c + psq.p;
659 }
660
661 // Before move is played, update variables + flags
662 updateVariables(move)
663 {
664 const piece = this.getPiece(move.start.x,move.start.y);
665 const c = this.getColor(move.start.x,move.start.y);
666 const firstRank = (c == "w" ? 7 : 0);
667
668 // Update king position + flags
669 if (piece == VariantRules.KING && move.appear.length > 0)
670 {
671 this.kingPos[c][0] = move.appear[0].x;
672 this.kingPos[c][1] = move.appear[0].y;
673 this.castleFlags[c] = [false,false];
674 return;
675 }
676 const oppCol = this.getOppCol(c);
677 const oppFirstRank = 7 - firstRank;
678 if (move.start.x == firstRank //our rook moves?
679 && this.INIT_COL_ROOK[c].includes(move.start.y))
680 {
681 const flagIdx = (move.start.y == this.INIT_COL_ROOK[c][0] ? 0 : 1);
682 this.castleFlags[c][flagIdx] = false;
683 }
684 else if (move.end.x == oppFirstRank //we took opponent rook?
685 && this.INIT_COL_ROOK[c].includes(move.end.y))
686 {
687 const flagIdx = (move.end.y == this.INIT_COL_ROOK[oppCol][0] ? 0 : 1);
688 this.castleFlags[oppCol][flagIdx] = false;
689 }
690 }
691
692 unupdateVariables(move)
693 {
694 // (Potentially) Reset king position
695 const c = this.getColor(move.start.x,move.start.y);
696 if (this.getPiece(move.start.x,move.start.y) == VariantRules.KING)
697 this.kingPos[c] = [move.start.x, move.start.y];
698 }
699
700 play(move, ingame)
701 {
702 console.log("AVANT " + this.getNotation(move) + " " + this.board[1][5]);
703 if (!!ingame)
704 move.notation = this.getNotation(move);
705
706 move.flags = JSON.stringify(this.flags); //save flags (for undo)
707 this.updateVariables(move);
708 this.moves.push(move);
709 this.epSquares.push( this.getEpSquare(move) );
710 VariantRules.PlayOnBoard(this.board, move);
711 }
712
713 undo(move)
714 {
715 VariantRules.UndoOnBoard(this.board, move);
716 this.epSquares.pop();
717 this.moves.pop();
718 this.unupdateVariables(move);
719 this.parseFlags(JSON.parse(move.flags));
720 console.log("APRES " + this.getNotation(move) + " " + this.board[1][5]);
721 }
722
723 //////////////
724 // END OF GAME
725
726 checkRepetition()
727 {
728 // Check for 3 repetitions
729 if (this.moves.length >= 8)
730 {
731 // NOTE: crude detection, only moves repetition
732 const L = this.moves.length;
733 if (_.isEqual(this.moves[L-1], this.moves[L-5]) &&
734 _.isEqual(this.moves[L-2], this.moves[L-6]) &&
735 _.isEqual(this.moves[L-3], this.moves[L-7]) &&
736 _.isEqual(this.moves[L-4], this.moves[L-8]))
737 {
738 return true;
739 }
740 }
741 return false;
742 }
743
744 checkGameOver()
745 {
746 if (this.checkRepetition())
747 return "1/2";
748
749 if (this.atLeastOneMove()) // game not over
750 return "*";
751
752 // Game over
753 return this.checkGameEnd();
754 }
755
756 // No moves are possible: compute score
757 checkGameEnd()
758 {
759 const color = this.turn;
760 // No valid move: stalemate or checkmate?
761 if (!this.isAttacked(this.kingPos[color], this.getOppCol(color)))
762 return "1/2";
763 // OK, checkmate
764 return color == "w" ? "0-1" : "1-0";
765 }
766
767 ////////
768 //ENGINE
769
770 // Pieces values
771 static get VALUES() {
772 return {
773 'p': 1,
774 'r': 5,
775 'n': 3,
776 'b': 3,
777 'q': 9,
778 'k': 1000
779 };
780 }
781
782 // Assumption: at least one legal move
783 getComputerMove()
784 {
785 const color = this.turn;
786
787 // Rank moves using a min-max at depth 2
788 let moves1 = this.getAllValidMoves();
789
790 for (let i=0; i<moves1.length; i++)
791 {
792 moves1[i].eval = (color=="w" ? -1 : 1) * 1000; //very low, I'm checkmated
793 let eval2 = (color=="w" ? 1 : -1) * 1000; //initialized with very high (checkmate) value
794 this.play(moves1[i]);
795 // Second half-move:
796 let moves2 = this.getAllValidMoves();
797 // If no possible moves AND underCheck, eval2 is correct.
798 // If !underCheck, eval2 is 0 (stalemate).
799 if (moves2.length == 0 && this.checkGameEnd() == "1/2")
800 eval2 = 0;
801 for (let j=0; j<moves2.length; j++)
802 {
803 this.play(moves2[j]);
804 let evalPos = this.evalPosition();
805 if ((color == "w" && evalPos < eval2) || (color=="b" && evalPos > eval2))
806 eval2 = evalPos;
807 this.undo(moves2[j]);
808 }
809 if ((color=="w" && eval2 > moves1[i].eval) || (color=="b" && eval2 < moves1[i].eval))
810 moves1[i].eval = eval2;
811 this.undo(moves1[i]);
812 }
813 moves1.sort( (a,b) => { return (color=="w" ? 1 : -1) * (b.eval - a.eval); });
814
815 // TODO: show current analyzed move for depth 3, allow stopping eval (return moves1[0])
816 for (let i=0; i<moves1.length; i++)
817 {
818 this.play(moves1[i]);
819 // 0.1 * oldEval : heuristic to avoid some bad moves (not all...)
820 moves1[i].eval = 0.1*moves1[i].eval + this.alphabeta(2, -1000, 1000);
821 this.undo(moves1[i]);
822 }
823 moves1.sort( (a,b) => { return (color=="w" ? 1 : -1) * (b.eval - a.eval); });
824
825 let candidates = [0]; //indices of candidates moves
826 for (let j=1; j<moves1.length && moves1[j].eval == moves1[0].eval; j++)
827 candidates.push(j);
828
829 //console.log(moves1.map(m => { return [this.getNotation(m), m.eval]; }));
830 return moves1[_.sample(candidates, 1)];
831 }
832
833 alphabeta(depth, alpha, beta)
834 {
835 const color = this.turn;
836 if (!this.atLeastOneMove())
837 {
838 switch (this.checkGameEnd())
839 {
840 case "1/2": return 0;
841 default: return color=="w" ? -1000 : 1000;
842 }
843 }
844 if (depth == 0)
845 return this.evalPosition();
846 const moves = this.getAllValidMoves();
847 let v = color=="w" ? -1000 : 1000;
848 if (color == "w")
849 {
850 for (let i=0; i<moves.length; i++)
851 {
852 this.play(moves[i]);
853 v = Math.max(v, this.alphabeta(depth-1, alpha, beta));
854 this.undo(moves[i]);
855 alpha = Math.max(alpha, v);
856 if (alpha >= beta)
857 break; //beta cutoff
858 }
859 }
860 else //color=="b"
861 {
862 for (let i=0; i<moves.length; i++)
863 {
864 this.play(moves[i]);
865 v = Math.min(v, this.alphabeta(depth-1, alpha, beta));
866 this.undo(moves[i]);
867 beta = Math.min(beta, v);
868 if (alpha >= beta)
869 break; //alpha cutoff
870 }
871 }
872 return v;
873 }
874
875 evalPosition()
876 {
877 const [sizeX,sizeY] = VariantRules.size;
878 let evaluation = 0;
879 //Just count material for now
880 for (let i=0; i<sizeX; i++)
881 {
882 for (let j=0; j<sizeY; j++)
883 {
884 if (this.board[i][j] != VariantRules.EMPTY)
885 {
886 const sign = this.getColor(i,j) == "w" ? 1 : -1;
887 evaluation += sign * VariantRules.VALUES[this.getPiece(i,j)];
888 }
889 }
890 }
891 return evaluation;
892 }
893
894 ////////////
895 // FEN utils
896
897 // Overridable..
898 static GenRandInitFen()
899 {
900 let pieces = [new Array(8), new Array(8)];
901 // Shuffle pieces on first and last rank
902 for (let c = 0; c <= 1; c++)
903 {
904 let positions = _.range(8);
905
906 // Get random squares for bishops
907 let randIndex = 2 * _.random(3);
908 let bishop1Pos = positions[randIndex];
909 // The second bishop must be on a square of different color
910 let randIndex_tmp = 2 * _.random(3) + 1;
911 let bishop2Pos = positions[randIndex_tmp];
912 // Remove chosen squares
913 positions.splice(Math.max(randIndex,randIndex_tmp), 1);
914 positions.splice(Math.min(randIndex,randIndex_tmp), 1);
915
916 // Get random squares for knights
917 randIndex = _.random(5);
918 let knight1Pos = positions[randIndex];
919 positions.splice(randIndex, 1);
920 randIndex = _.random(4);
921 let knight2Pos = positions[randIndex];
922 positions.splice(randIndex, 1);
923
924 // Get random square for queen
925 randIndex = _.random(3);
926 let queenPos = positions[randIndex];
927 positions.splice(randIndex, 1);
928
929 // Rooks and king positions are now fixed, because of the ordering rook-king-rook
930 let rook1Pos = positions[0];
931 let kingPos = positions[1];
932 let rook2Pos = positions[2];
933
934 // Finally put the shuffled pieces in the board array
935 pieces[c][rook1Pos] = 'r';
936 pieces[c][knight1Pos] = 'n';
937 pieces[c][bishop1Pos] = 'b';
938 pieces[c][queenPos] = 'q';
939 pieces[c][kingPos] = 'k';
940 pieces[c][bishop2Pos] = 'b';
941 pieces[c][knight2Pos] = 'n';
942 pieces[c][rook2Pos] = 'r';
943 }
944 let fen = pieces[0].join("") +
945 "/pppppppp/8/8/8/8/PPPPPPPP/" +
946 pieces[1].join("").toUpperCase() +
947 " 1111"; //add flags
948 return fen;
949 }
950
951 // Return current fen according to pieces+colors state
952 getFen()
953 {
954 return this.getBaseFen() + " " + this.getFlagsFen();
955 }
956
957 getBaseFen()
958 {
959 let fen = "";
960 let [sizeX,sizeY] = VariantRules.size;
961 for (let i=0; i<sizeX; i++)
962 {
963 let emptyCount = 0;
964 for (let j=0; j<sizeY; j++)
965 {
966 if (this.board[i][j] == VariantRules.EMPTY)
967 emptyCount++;
968 else
969 {
970 if (emptyCount > 0)
971 {
972 // Add empty squares in-between
973 fen += emptyCount;
974 emptyCount = 0;
975 }
976 fen += VariantRules.board2fen(this.board[i][j]);
977 }
978 }
979 if (emptyCount > 0)
980 {
981 // "Flush remainder"
982 fen += emptyCount;
983 }
984 if (i < sizeX - 1)
985 fen += "/"; //separate rows
986 }
987 return fen;
988 }
989
990 // Overridable..
991 getFlagsFen()
992 {
993 let fen = "";
994 // Add castling flags
995 for (let i of ['w','b'])
996 {
997 for (let j=0; j<2; j++)
998 fen += this.castleFlags[i][j] ? '1' : '0';
999 }
1000 return fen;
1001 }
1002
1003 // Context: just before move is played, turn hasn't changed
1004 getNotation(move)
1005 {
1006 if (move.appear.length == 2)
1007 {
1008 // Castle
1009 if (move.end.y < move.start.y)
1010 return "0-0-0";
1011 else
1012 return "0-0";
1013 }
1014
1015 // Translate final square
1016 let finalSquare =
1017 String.fromCharCode(97 + move.end.y) + (VariantRules.size[0]-move.end.x);
1018
1019 let piece = this.getPiece(move.start.x, move.start.y);
1020 if (piece == VariantRules.PAWN)
1021 {
1022 // Pawn move
1023 let notation = "";
1024 if (move.vanish.length > 1)
1025 {
1026 // Capture
1027 let startColumn = String.fromCharCode(97 + move.start.y);
1028 notation = startColumn + "x" + finalSquare;
1029 }
1030 else //no capture
1031 notation = finalSquare;
1032 if (move.appear.length > 0 && piece != move.appear[0].p) //promotion
1033 notation += "=" + move.appear[0].p.toUpperCase();
1034 return notation;
1035 }
1036
1037 else
1038 {
1039 // Piece movement
1040 return piece.toUpperCase() + (move.vanish.length > 1 ? "x" : "") + finalSquare;
1041 }
1042 }
1043
1044 // The score is already computed when calling this function
1045 getPGN(mycolor, score, fenStart, mode)
1046 {
1047 let pgn = "";
1048 pgn += '[Site "vchess.club"]<br>';
1049 const d = new Date();
1050 const opponent = mode=="human" ? "Anonymous" : "Computer";
1051 pgn += '[Date "' + d.getFullYear() + '-' + (d.getMonth()+1) + '-' + d.getDate() + '"]<br>';
1052 pgn += '[White "' + (mycolor=='w'?'Myself':opponent) + '"]<br>';
1053 pgn += '[Black "' + (mycolor=='b'?'Myself':opponent) + '"]<br>';
1054 pgn += '[Fen "' + fenStart + '"]<br>';
1055 pgn += '[Result "' + score + '"]<br><br>';
1056
1057 for (let i=0; i<this.moves.length; i++)
1058 {
1059 if (i % 2 == 0)
1060 pgn += ((i/2)+1) + ".";
1061 pgn += this.moves[i].notation + " ";
1062 }
1063
1064 pgn += score;
1065 return pgn;
1066 }
1067 }
Website to play original chess variants