1 import { ArrayFun
} from "@/utils/array";
2 import { randInt
} from "@/utils/alea";
3 import { ChessRules
, PiPo
, Move
} from "@/base_rules";
5 export class EightpiecesRules
extends ChessRules
{
16 static get IMAGE_EXTENSION() {
17 // Temporarily, for the time SVG pieces are being designed:
21 // Lancer directions *from white perspective*
22 static get LANCER_DIRS() {
36 return ChessRules
.PIECES
37 .concat([V
.JAILER
, V
.SENTRY
])
38 .concat(Object
.keys(V
.LANCER_DIRS
));
42 const piece
= this.board
[i
][j
].charAt(1);
43 // Special lancer case: 8 possible orientations
44 if (Object
.keys(V
.LANCER_DIRS
).includes(piece
)) return V
.LANCER
;
48 getPpath(b
, color
, score
, orientation
) {
49 if ([V
.JAILER
, V
.SENTRY
].includes(b
[1])) return "Eightpieces/tmp_png/" + b
;
50 if (Object
.keys(V
.LANCER_DIRS
).includes(b
[1])) {
51 if (orientation
== 'w') return "Eightpieces/tmp_png/" + b
;
52 // Find opposite direction for adequate display:
80 return "Eightpieces/tmp_png/" + b
[0] + oppDir
;
82 // TODO: after we have SVG pieces, remove the folder and next prefix:
83 return "Eightpieces/tmp_png/" + b
;
86 getPPpath(m
, orientation
) {
89 m
.appear
[0].c
+ m
.appear
[0].p
,
97 static ParseFen(fen
) {
98 const fenParts
= fen
.split(" ");
100 ChessRules
.ParseFen(fen
),
101 { sentrypush: fenParts
[5] }
105 static IsGoodFen(fen
) {
106 if (!ChessRules
.IsGoodFen(fen
)) return false;
107 const fenParsed
= V
.ParseFen(fen
);
108 // 5) Check sentry push (if any)
110 fenParsed
.sentrypush
!= "-" &&
111 !fenParsed
.sentrypush
.match(/^([a-h][1-8],?)+$/)
119 return super.getFen() + " " + this.getSentrypushFen();
123 return super.getFenForRepeat() + "_" + this.getSentrypushFen();
127 const L
= this.sentryPush
.length
;
128 if (!this.sentryPush
[L
-1]) return "-";
130 this.sentryPush
[L
-1].forEach(coords
=>
131 res
+= V
.CoordsToSquare(coords
) + ",");
132 return res
.slice(0, -1);
135 setOtherVariables(fen
) {
136 super.setOtherVariables(fen
);
137 // subTurn == 2 only when a sentry moved, and is about to push something
139 // Sentry position just after a "capture" (subTurn from 1 to 2)
140 this.sentryPos
= null;
141 // Stack pieces' forbidden squares after a sentry move at each turn
142 const parsedFen
= V
.ParseFen(fen
);
143 if (parsedFen
.sentrypush
== "-") this.sentryPush
= [null];
146 parsedFen
.sentrypush
.split(",").map(sq
=> {
147 return V
.SquareToCoords(sq
);
153 static GenRandInitFen(randomness
) {
156 return "jfsqkbnr/pppppppp/8/8/8/8/PPPPPPPP/JDSQKBNR w 0 ahah - -";
158 let pieces
= { w: new Array(8), b: new Array(8) };
160 // Shuffle pieces on first (and last rank if randomness == 2)
161 for (let c
of ["w", "b"]) {
162 if (c
== 'b' && randomness
== 1) {
163 const lancerIdx
= pieces
['w'].findIndex(p
=> {
164 return Object
.keys(V
.LANCER_DIRS
).includes(p
);
167 pieces
['w'].slice(0, lancerIdx
)
169 .concat(pieces
['w'].slice(lancerIdx
+ 1));
174 let positions
= ArrayFun
.range(8);
176 // Get random squares for bishop and sentry
177 let randIndex
= 2 * randInt(4);
178 let bishopPos
= positions
[randIndex
];
179 // The sentry must be on a square of different color
180 let randIndex_tmp
= 2 * randInt(4) + 1;
181 let sentryPos
= positions
[randIndex_tmp
];
183 // Check if white sentry is on the same color as ours.
184 // If yes: swap bishop and sentry positions.
185 // NOTE: test % 2 == 1 because there are 7 slashes.
186 if ((pieces
['w'].indexOf('s') - sentryPos
) % 2 == 1)
187 [bishopPos
, sentryPos
] = [sentryPos
, bishopPos
];
189 positions
.splice(Math
.max(randIndex
, randIndex_tmp
), 1);
190 positions
.splice(Math
.min(randIndex
, randIndex_tmp
), 1);
192 // Get random squares for knight and lancer
193 randIndex
= randInt(6);
194 const knightPos
= positions
[randIndex
];
195 positions
.splice(randIndex
, 1);
196 randIndex
= randInt(5);
197 const lancerPos
= positions
[randIndex
];
198 positions
.splice(randIndex
, 1);
200 // Get random square for queen
201 randIndex
= randInt(4);
202 const queenPos
= positions
[randIndex
];
203 positions
.splice(randIndex
, 1);
205 // Rook, jailer and king positions are now almost fixed,
206 // only the ordering rook->jailer or jailer->rook must be decided.
207 let rookPos
= positions
[0];
208 let jailerPos
= positions
[2];
209 const kingPos
= positions
[1];
210 flags
+= V
.CoordToColumn(rookPos
) + V
.CoordToColumn(jailerPos
);
211 if (Math
.random() < 0.5) [rookPos
, jailerPos
] = [jailerPos
, rookPos
];
213 pieces
[c
][rookPos
] = "r";
214 pieces
[c
][knightPos
] = "n";
215 pieces
[c
][bishopPos
] = "b";
216 pieces
[c
][queenPos
] = "q";
217 pieces
[c
][kingPos
] = "k";
218 pieces
[c
][sentryPos
] = "s";
219 // Lancer faces north for white, and south for black:
220 pieces
[c
][lancerPos
] = c
== 'w' ? 'c' : 'g';
221 pieces
[c
][jailerPos
] = "j";
224 pieces
["b"].join("") +
225 "/pppppppp/8/8/8/8/PPPPPPPP/" +
226 pieces
["w"].join("").toUpperCase() +
227 " w 0 " + flags
+ " - -"
231 canTake([x1
, y1
], [x2
, y2
]) {
232 if (this.subTurn
== 2)
233 // Only self captures on this subturn:
234 return this.getColor(x1
, y1
) == this.getColor(x2
, y2
);
235 return super.canTake([x1
, y1
], [x2
, y2
]);
238 // Is piece on square (x,y) immobilized?
239 isImmobilized([x
, y
]) {
240 const color
= this.getColor(x
, y
);
241 const oppCol
= V
.GetOppCol(color
);
242 for (let step
of V
.steps
[V
.ROOK
]) {
243 const [i
, j
] = [x
+ step
[0], y
+ step
[1]];
246 this.board
[i
][j
] != V
.EMPTY
&&
247 this.getColor(i
, j
) == oppCol
249 if (this.getPiece(i
, j
) == V
.JAILER
) return [i
, j
];
255 // Because of the lancers, getPiece() could be wrong:
256 // use board[x][y][1] instead (always valid).
257 getBasicMove([sx
, sy
], [ex
, ey
], tr
) {
258 const initColor
= this.getColor(sx
, sy
);
259 const initPiece
= this.board
[sx
][sy
].charAt(1);
265 c: tr
? tr
.c : initColor
,
266 p: tr
? tr
.p : initPiece
279 // The opponent piece disappears if we take it
280 if (this.board
[ex
][ey
] != V
.EMPTY
) {
285 c: this.getColor(ex
, ey
),
286 p: this.board
[ex
][ey
].charAt(1)
294 canIplay(side
, [x
, y
]) {
296 (this.subTurn
== 1 && this.turn
== side
&& this.getColor(x
, y
) == side
)
298 (this.subTurn
== 2 && x
== this.sentryPos
.x
&& y
== this.sentryPos
.y
)
302 getPotentialMovesFrom([x
, y
]) {
303 // At subTurn == 2, jailers aren't effective (Jeff K)
304 const piece
= this.getPiece(x
, y
);
305 const L
= this.sentryPush
.length
;
306 if (this.subTurn
== 1) {
307 const jsq
= this.isImmobilized([x
, y
]);
310 // Special pass move if king:
311 if (piece
== V
.KING
) {
316 start: { x: x
, y: y
},
317 end: { x: jsq
[0], y: jsq
[1] }
321 else if (piece
== V
.LANCER
&& !!this.sentryPush
[L
-1]) {
322 // A pushed lancer next to the jailer: reorient
323 const color
= this.getColor(x
, y
);
324 const curDir
= this.board
[x
][y
].charAt(1);
325 Object
.keys(V
.LANCER_DIRS
).forEach(k
=> {
328 appear: [{ x: x
, y: y
, c: color
, p: k
}],
329 vanish: [{ x: x
, y: y
, c: color
, p: curDir
}],
330 start: { x: x
, y: y
},
331 end: { x: jsq
[0], y: jsq
[1] }
342 moves
= this.getPotentialJailerMoves([x
, y
]);
345 moves
= this.getPotentialSentryMoves([x
, y
]);
348 moves
= this.getPotentialLancerMoves([x
, y
]);
351 moves
= super.getPotentialMovesFrom([x
, y
]);
354 if (!!this.sentryPush
[L
-1]) {
355 // Delete moves walking back on sentry push path,
356 // only if not a pawn, and the piece is the pushed one.
357 const pl
= this.sentryPush
[L
-1].length
;
358 const finalPushedSq
= this.sentryPush
[L
-1][pl
-1];
359 moves
= moves
.filter(m
=> {
361 m
.vanish
[0].p
!= V
.PAWN
&&
362 m
.start
.x
== finalPushedSq
.x
&& m
.start
.y
== finalPushedSq
.y
&&
363 this.sentryPush
[L
-1].some(sq
=> sq
.x
== m
.end
.x
&& sq
.y
== m
.end
.y
)
369 } else if (this.subTurn
== 2) {
370 // Put back the sentinel on board:
371 const color
= this.turn
;
373 m
.appear
.push({x: x
, y: y
, p: V
.SENTRY
, c: color
});
379 getPotentialPawnMoves([x
, y
]) {
380 const color
= this.getColor(x
, y
);
382 const [sizeX
, sizeY
] = [V
.size
.x
, V
.size
.y
];
383 let shiftX
= (color
== "w" ? -1 : 1);
384 if (this.subTurn
== 2) shiftX
*= -1;
385 const firstRank
= color
== "w" ? sizeX
- 1 : 0;
386 const startRank
= color
== "w" ? sizeX
- 2 : 1;
387 const lastRank
= color
== "w" ? 0 : sizeX
- 1;
389 // Pawns might be pushed on 1st rank and attempt to move again:
390 if (!V
.OnBoard(x
+ shiftX
, y
)) return [];
393 // A push cannot put a pawn on last rank (it goes backward)
394 x
+ shiftX
== lastRank
395 ? Object
.keys(V
.LANCER_DIRS
).concat(
396 [V
.ROOK
, V
.KNIGHT
, V
.BISHOP
, V
.QUEEN
, V
.SENTRY
, V
.JAILER
])
398 if (this.board
[x
+ shiftX
][y
] == V
.EMPTY
) {
399 // One square forward
400 for (let piece
of finalPieces
) {
402 this.getBasicMove([x
, y
], [x
+ shiftX
, y
], {
409 // 2-squares jumps forbidden if pawn push
411 [startRank
, firstRank
].includes(x
) &&
412 this.board
[x
+ 2 * shiftX
][y
] == V
.EMPTY
415 moves
.push(this.getBasicMove([x
, y
], [x
+ 2 * shiftX
, y
]));
419 for (let shiftY
of [-1, 1]) {
422 y
+ shiftY
< sizeY
&&
423 this.board
[x
+ shiftX
][y
+ shiftY
] != V
.EMPTY
&&
424 this.canTake([x
, y
], [x
+ shiftX
, y
+ shiftY
])
426 for (let piece
of finalPieces
) {
428 this.getBasicMove([x
, y
], [x
+ shiftX
, y
+ shiftY
], {
437 // En passant: only on subTurn == 1
438 const Lep
= this.epSquares
.length
;
439 const epSquare
= this.epSquares
[Lep
- 1];
443 epSquare
.x
== x
+ shiftX
&&
444 Math
.abs(epSquare
.y
- y
) == 1
446 let enpassantMove
= this.getBasicMove([x
, y
], [epSquare
.x
, epSquare
.y
]);
447 enpassantMove
.vanish
.push({
451 c: this.getColor(x
, epSquare
.y
)
453 moves
.push(enpassantMove
);
459 // Obtain all lancer moves in "step" direction
460 getPotentialLancerMoves_aux([x
, y
], step
, tr
) {
462 // Add all moves to vacant squares until opponent is met:
463 const color
= this.getColor(x
, y
);
467 // at subTurn == 2, consider own pieces as opponent
469 let sq
= [x
+ step
[0], y
+ step
[1]];
470 while (V
.OnBoard(sq
[0], sq
[1]) && this.getColor(sq
[0], sq
[1]) != oppCol
) {
471 if (this.board
[sq
[0]][sq
[1]] == V
.EMPTY
)
472 moves
.push(this.getBasicMove([x
, y
], sq
, tr
));
476 if (V
.OnBoard(sq
[0], sq
[1]))
477 // Add capturing move
478 moves
.push(this.getBasicMove([x
, y
], sq
, tr
));
482 getPotentialLancerMoves([x
, y
]) {
484 // Add all lancer possible orientations, similar to pawn promotions.
485 // Except if just after a push: allow all movements from init square then
486 const L
= this.sentryPush
.length
;
487 const color
= this.getColor(x
, y
);
488 if (!!this.sentryPush
[L
-1]) {
489 // Maybe I was pushed
490 const pl
= this.sentryPush
[L
-1].length
;
492 this.sentryPush
[L
-1][pl
-1].x
== x
&&
493 this.sentryPush
[L
-1][pl
-1].y
== y
495 // I was pushed: allow all directions (for this move only), but
496 // do not change direction after moving, *except* if I keep the
497 // same orientation in which I was pushed.
498 const curDir
= V
.LANCER_DIRS
[this.board
[x
][y
].charAt(1)];
499 Object
.values(V
.LANCER_DIRS
).forEach(step
=> {
500 const dirCode
= Object
.keys(V
.LANCER_DIRS
).find(k
=> {
502 V
.LANCER_DIRS
[k
][0] == step
[0] &&
503 V
.LANCER_DIRS
[k
][1] == step
[1]
507 this.getPotentialLancerMoves_aux(
510 { p: dirCode
, c: color
}
512 if (curDir
[0] == step
[0] && curDir
[1] == step
[1]) {
513 // Keeping same orientation: can choose after
514 let chooseMoves
= [];
515 dirMoves
.forEach(m
=> {
516 Object
.keys(V
.LANCER_DIRS
).forEach(k
=> {
517 let mk
= JSON
.parse(JSON
.stringify(m
));
522 Array
.prototype.push
.apply(moves
, chooseMoves
);
523 } else Array
.prototype.push
.apply(moves
, dirMoves
);
528 // I wasn't pushed: standard lancer move
529 const dirCode
= this.board
[x
][y
][1];
531 this.getPotentialLancerMoves_aux([x
, y
], V
.LANCER_DIRS
[dirCode
]);
532 // Add all possible orientations aftermove except if I'm being pushed
533 if (this.subTurn
== 1) {
534 monodirMoves
.forEach(m
=> {
535 Object
.keys(V
.LANCER_DIRS
).forEach(k
=> {
536 let mk
= JSON
.parse(JSON
.stringify(m
));
543 // I'm pushed: add potential nudges
544 let potentialNudges
= [];
545 for (let step
of V
.steps
[V
.ROOK
].concat(V
.steps
[V
.BISHOP
])) {
547 V
.OnBoard(x
+ step
[0], y
+ step
[1]) &&
548 this.board
[x
+ step
[0]][y
+ step
[1]] == V
.EMPTY
550 const newDirCode
= Object
.keys(V
.LANCER_DIRS
).find(k
=> {
551 const codeStep
= V
.LANCER_DIRS
[k
];
552 return (codeStep
[0] == step
[0] && codeStep
[1] == step
[1]);
554 potentialNudges
.push(
557 [x
+ step
[0], y
+ step
[1]],
558 { c: color
, p: newDirCode
}
563 return monodirMoves
.concat(potentialNudges
);
567 getPotentialSentryMoves([x
, y
]) {
568 // The sentry moves a priori like a bishop:
569 let moves
= super.getPotentialBishopMoves([x
, y
]);
570 // ...but captures are replaced by special move, if and only if
571 // "captured" piece can move now, considered as the capturer unit.
572 // --> except is subTurn == 2, in this case I don't push anything.
573 if (this.subTurn
== 2) return moves
.filter(m
=> m
.vanish
.length
== 1);
575 if (m
.vanish
.length
== 2) {
576 // Temporarily cancel the sentry capture:
581 const color
= this.getColor(x
, y
);
582 const fMoves
= moves
.filter(m
=> {
583 // Can the pushed unit make any move? ...resulting in a non-self-check?
584 if (m
.appear
.length
== 0) {
587 let moves2
= this.getPotentialMovesFrom([m
.end
.x
, m
.end
.y
]);
588 for (let m2
of moves2
) {
590 res
= !this.underCheck(color
);
602 getPotentialJailerMoves([x
, y
]) {
603 return super.getPotentialRookMoves([x
, y
]).filter(m
=> {
604 // Remove jailer captures
605 return m
.vanish
[0].p
!= V
.JAILER
|| m
.vanish
.length
== 1;
609 getPotentialKingMoves(sq
) {
610 const moves
= this.getSlideNJumpMoves(
612 V
.steps
[V
.ROOK
].concat(V
.steps
[V
.BISHOP
]),
617 ? moves
.concat(this.getCastleMoves(sq
))
623 // If in second-half of a move, we already know that a move is possible
624 if (this.subTurn
== 2) return true;
625 return super.atLeastOneMove();
629 if (moves
.length
== 0) return [];
630 const basicFilter
= (m
, c
) => {
632 const res
= !this.underCheck(c
);
636 // Disable check tests for sentry pushes,
637 // because in this case the move isn't finished
638 let movesWithoutSentryPushes
= [];
639 let movesWithSentryPushes
= [];
641 // Second condition below for special king "pass" moves
642 if (m
.appear
.length
> 0 || m
.vanish
.length
== 0)
643 movesWithoutSentryPushes
.push(m
);
644 else movesWithSentryPushes
.push(m
);
646 const color
= this.turn
;
647 const oppCol
= V
.GetOppCol(color
);
648 const filteredMoves
=
649 movesWithoutSentryPushes
.filter(m
=> basicFilter(m
, color
));
650 // If at least one full move made, everything is allowed.
651 // Else: forbid checks and captures.
655 : filteredMoves
.filter(m
=> {
656 return (m
.vanish
.length
<= 1 && basicFilter(m
, oppCol
));
658 ).concat(movesWithSentryPushes
);
662 if (this.subTurn
== 1) return super.getAllValidMoves();
664 const sentrySq
= [this.sentryPos
.x
, this.sentryPos
.y
];
665 return this.filterValid(this.getPotentialMovesFrom(sentrySq
));
668 isAttacked(sq
, color
) {
670 super.isAttacked(sq
, color
) ||
671 this.isAttackedByLancer(sq
, color
) ||
672 this.isAttackedBySentry(sq
, color
)
673 // The jailer doesn't capture.
677 isAttackedBySlideNJump([x
, y
], color
, piece
, steps
, oneStep
) {
678 for (let step
of steps
) {
679 let rx
= x
+ step
[0],
681 while (V
.OnBoard(rx
, ry
) && this.board
[rx
][ry
] == V
.EMPTY
&& !oneStep
) {
687 this.getPiece(rx
, ry
) == piece
&&
688 this.getColor(rx
, ry
) == color
&&
689 !this.isImmobilized([rx
, ry
])
697 isAttackedByPawn([x
, y
], color
) {
698 const pawnShift
= (color
== "w" ? 1 : -1);
699 if (x
+ pawnShift
>= 0 && x
+ pawnShift
< V
.size
.x
) {
700 for (let i
of [-1, 1]) {
704 this.getPiece(x
+ pawnShift
, y
+ i
) == V
.PAWN
&&
705 this.getColor(x
+ pawnShift
, y
+ i
) == color
&&
706 !this.isImmobilized([x
+ pawnShift
, y
+ i
])
715 isAttackedByLancer([x
, y
], color
) {
716 for (let step
of V
.steps
[V
.ROOK
].concat(V
.steps
[V
.BISHOP
])) {
717 // If in this direction there are only enemy pieces and empty squares,
718 // and we meet a lancer: can he reach us?
719 // NOTE: do not stop at first lancer, there might be several!
720 let coord
= { x: x
+ step
[0], y: y
+ step
[1] };
723 V
.OnBoard(coord
.x
, coord
.y
) &&
725 this.board
[coord
.x
][coord
.y
] == V
.EMPTY
||
726 this.getColor(coord
.x
, coord
.y
) == color
730 this.getPiece(coord
.x
, coord
.y
) == V
.LANCER
&&
731 !this.isImmobilized([coord
.x
, coord
.y
])
733 lancerPos
.push({x: coord
.x
, y: coord
.y
});
738 for (let xy
of lancerPos
) {
739 const dir
= V
.LANCER_DIRS
[this.board
[xy
.x
][xy
.y
].charAt(1)];
740 if (dir
[0] == -step
[0] && dir
[1] == -step
[1]) return true;
746 // Helper to check sentries attacks:
747 selfAttack([x1
, y1
], [x2
, y2
]) {
748 const color
= this.getColor(x1
, y1
);
749 const oppCol
= V
.GetOppCol(color
);
750 const sliderAttack
= (allowedSteps
, lancer
) => {
751 const deltaX
= x2
- x1
,
752 absDeltaX
= Math
.abs(deltaX
);
753 const deltaY
= y2
- y1
,
754 absDeltaY
= Math
.abs(deltaY
);
755 const step
= [ deltaX
/ absDeltaX
|| 0, deltaY
/ absDeltaY
|| 0 ];
757 // Check that the step is a priori valid:
758 (absDeltaX
!= absDeltaY
&& deltaX
!= 0 && deltaY
!= 0) ||
759 allowedSteps
.every(st
=> st
[0] != step
[0] || st
[1] != step
[1])
763 let sq
= [ x1
+ step
[0], y1
+ step
[1] ];
764 while (sq
[0] != x2
|| sq
[1] != y2
) {
766 // NOTE: no need to check OnBoard in this special case
767 (!lancer
&& this.board
[sq
[0]][sq
[1]] != V
.EMPTY
) ||
768 (!!lancer
&& this.getColor(sq
[0], sq
[1]) == oppCol
)
777 switch (this.getPiece(x1
, y1
)) {
779 // Pushed pawns move as enemy pawns
780 const shift
= (color
== 'w' ? 1 : -1);
781 return (x1
+ shift
== x2
&& Math
.abs(y1
- y2
) == 1);
784 const deltaX
= Math
.abs(x1
- x2
);
785 const deltaY
= Math
.abs(y1
- y2
);
787 deltaX
+ deltaY
== 3 &&
788 [1, 2].includes(deltaX
) &&
789 [1, 2].includes(deltaY
)
793 return sliderAttack(V
.steps
[V
.ROOK
]);
795 return sliderAttack(V
.steps
[V
.BISHOP
]);
797 return sliderAttack(V
.steps
[V
.ROOK
].concat(V
.steps
[V
.BISHOP
]));
799 // Special case: as long as no enemy units stands in-between,
800 // it attacks (if it points toward the king).
801 const allowedStep
= V
.LANCER_DIRS
[this.board
[x1
][y1
].charAt(1)];
802 return sliderAttack([allowedStep
], "lancer");
804 // No sentries or jailer tests: they cannot self-capture
809 isAttackedBySentry([x
, y
], color
) {
810 // Attacked by sentry means it can self-take our king.
811 // Just check diagonals of enemy sentry(ies), and if it reaches
812 // one of our pieces: can I self-take?
813 const myColor
= V
.GetOppCol(color
);
815 for (let i
=0; i
<V
.size
.x
; i
++) {
816 for (let j
=0; j
<V
.size
.y
; j
++) {
818 this.getPiece(i
,j
) == V
.SENTRY
&&
819 this.getColor(i
,j
) == color
&&
820 !this.isImmobilized([i
, j
])
822 for (let step
of V
.steps
[V
.BISHOP
]) {
823 let sq
= [ i
+ step
[0], j
+ step
[1] ];
825 V
.OnBoard(sq
[0], sq
[1]) &&
826 this.board
[sq
[0]][sq
[1]] == V
.EMPTY
832 V
.OnBoard(sq
[0], sq
[1]) &&
833 this.getColor(sq
[0], sq
[1]) == myColor
835 candidates
.push([ sq
[0], sq
[1] ]);
841 for (let c
of candidates
)
842 if (this.selfAttack(c
, [x
, y
])) return true;
846 // Jailer doesn't capture or give check
849 if (move.appear
.length
== 0 && move.vanish
.length
== 1)
850 // The sentry is about to push a piece: subTurn goes from 1 to 2
851 this.sentryPos
= { x: move.end
.x
, y: move.end
.y
};
852 if (this.subTurn
== 2 && move.vanish
[0].p
!= V
.PAWN
) {
853 // A piece is pushed: forbid array of squares between start and end
854 // of move, included (except if it's a pawn)
856 if ([V
.KNIGHT
,V
.KING
].includes(move.vanish
[0].p
))
857 // short-range pieces: just forbid initial square
858 squares
.push({ x: move.start
.x
, y: move.start
.y
});
860 const deltaX
= move.end
.x
- move.start
.x
;
861 const deltaY
= move.end
.y
- move.start
.y
;
863 deltaX
/ Math
.abs(deltaX
) || 0,
864 deltaY
/ Math
.abs(deltaY
) || 0
867 let sq
= {x: move.start
.x
, y: move.start
.y
};
868 sq
.x
!= move.end
.x
|| sq
.y
!= move.end
.y
;
869 sq
.x
+= step
[0], sq
.y
+= step
[1]
871 squares
.push({ x: sq
.x
, y: sq
.y
});
874 // Add end square as well, to know if I was pushed (useful for lancers)
875 squares
.push({ x: move.end
.x
, y: move.end
.y
});
876 this.sentryPush
.push(squares
);
877 } else this.sentryPush
.push(null);
882 move.flags
= JSON
.stringify(this.aggregateFlags());
883 this.epSquares
.push(this.getEpSquare(move));
884 V
.PlayOnBoard(this.board
, move);
885 // Is it a sentry push? (useful for undo)
886 move.sentryPush
= (this.subTurn
== 2);
887 if (this.subTurn
== 1) this.movesCount
++;
888 if (move.appear
.length
== 0 && move.vanish
.length
== 1) this.subTurn
= 2;
890 // Turn changes only if not a sentry "pre-push"
891 this.turn
= V
.GetOppCol(this.turn
);
898 if (move.vanish
.length
== 0 || this.subTurn
== 2)
899 // Special pass move of the king, or sentry pre-push: nothing to update
901 const c
= move.vanish
[0].c
;
902 const piece
= move.vanish
[0].p
;
903 const firstRank
= c
== "w" ? V
.size
.x
- 1 : 0;
905 if (piece
== V
.KING
) {
906 this.kingPos
[c
][0] = move.appear
[0].x
;
907 this.kingPos
[c
][1] = move.appear
[0].y
;
908 this.castleFlags
[c
] = [V
.size
.y
, V
.size
.y
];
911 // Update castling flags if rooks are moved
912 const oppCol
= V
.GetOppCol(c
);
913 const oppFirstRank
= V
.size
.x
- 1 - firstRank
;
915 move.start
.x
== firstRank
&& //our rook moves?
916 this.castleFlags
[c
].includes(move.start
.y
)
918 const flagIdx
= (move.start
.y
== this.castleFlags
[c
][0] ? 0 : 1);
919 this.castleFlags
[c
][flagIdx
] = V
.size
.y
;
921 move.end
.x
== oppFirstRank
&& //we took opponent rook?
922 this.castleFlags
[oppCol
].includes(move.end
.y
)
924 const flagIdx
= (move.end
.y
== this.castleFlags
[oppCol
][0] ? 0 : 1);
925 this.castleFlags
[oppCol
][flagIdx
] = V
.size
.y
;
930 this.epSquares
.pop();
931 this.disaggregateFlags(JSON
.parse(move.flags
));
932 V
.UndoOnBoard(this.board
, move);
933 // Decrement movesCount except if the move is a sentry push
934 if (!move.sentryPush
) this.movesCount
--;
935 if (this.subTurn
== 2) this.subTurn
= 1;
937 this.turn
= V
.GetOppCol(this.turn
);
938 if (move.sentryPush
) this.subTurn
= 2;
944 super.postUndo(move);
945 this.sentryPush
.pop();
948 static get VALUES() {
949 return Object
.assign(
950 { l: 4.8, s: 2.8, j: 3.8 }, //Jeff K. estimations
956 const maxeval
= V
.INFINITY
;
957 const color
= this.turn
;
958 let moves1
= this.getAllValidMoves();
960 if (moves1
.length
== 0)
961 // TODO: this situation should not happen
964 const setEval
= (move, next
) => {
965 const score
= this.getCurrentScore();
966 const curEval
= move.eval
;
971 : (score
== "1-0" ? 1 : -1) * maxeval
;
972 } else move.eval
= this.evalPosition();
974 // "next" is defined after sentry pushes
977 color
== 'w' && move.eval
> curEval
||
978 color
== 'b' && move.eval
< curEval
985 // Just search_depth == 1 (because of sentries. TODO: can do better...)
986 moves1
.forEach(m1
=> {
988 if (this.subTurn
== 1) setEval(m1
);
990 // Need to play every pushes and count:
991 const moves2
= this.getAllValidMoves();
992 moves2
.forEach(m2
=> {
1001 moves1
.sort((a
, b
) => {
1002 return (color
== "w" ? 1 : -1) * (b
.eval
- a
.eval
);
1004 let candidates
= [0];
1005 for (let j
= 1; j
< moves1
.length
&& moves1
[j
].eval
== moves1
[0].eval
; j
++)
1007 const choice
= moves1
[candidates
[randInt(candidates
.length
)]];
1008 return (!choice
.second
? choice : [choice
, choice
.second
]);
1011 // For moves notation:
1012 static get LANCER_DIRNAMES() {
1026 // Special case "king takes jailer" is a pass move
1027 if (move.appear
.length
== 0 && move.vanish
.length
== 0) return "pass";
1028 let notation
= undefined;
1029 if (this.subTurn
== 2) {
1030 // Do not consider appear[1] (sentry) for sentry pushes
1031 const simpleMove
= {
1032 appear: [move.appear
[0]],
1033 vanish: move.vanish
,
1037 notation
= super.getNotation(simpleMove
);
1038 } else notation
= super.getNotation(move);
1039 if (Object
.keys(V
.LANCER_DIRNAMES
).includes(move.vanish
[0].p
))
1040 // Lancer: add direction info
1041 notation
+= "=" + V
.LANCER_DIRNAMES
[move.appear
[0].p
];
1043 move.vanish
[0].p
== V
.PAWN
&&
1044 Object
.keys(V
.LANCER_DIRNAMES
).includes(move.appear
[0].p
)
1046 // Fix promotions in lancer:
1047 notation
= notation
.slice(0, -1) +
1048 "L:" + V
.LANCER_DIRNAMES
[move.appear
[0].p
];