super.setOtherVariables(fen);
// Stack of "last move" only for intermediate chaining
this.lastMoveEnd = [null];
+ this.repetitions = [];
}
static IsGoodFlags(flags) {
getCheckSquares() {
return [];
}
+
filterValid(moves) {
- return moves;
+ if (moves.length == 0) return [];
+ return moves.filter(m => {
+ if (!m.end.released) return true;
+ // Check for repetitions:
+ V.PlayOnBoard(this.board, m);
+ const newState = { piece: m.end.released, position: this.getBaseFen() };
+ const repet =
+ this.repetitions.some(r => {
+ return (
+ r.piece == newState.piece &&
+ r.position == newState.position
+ );
+ });
+ V.UndoOnBoard(this.board, m);
+ return !repet;
+ });
}
updateCastleFlags(move, piece) {
else
this.lastMoveEnd.push(Object.assign({ p: move.end.released }, move.end));
V.PlayOnBoard(this.board, move);
+ if (!move.end.released) this.repetitions = [];
+ else {
+ this.repetitions.push(
+ {
+ piece: move.end.released,
+ position: this.getBaseFen()
+ }
+ );
+ }
}
undo(move) {
this.turn = V.GetOppCol(this.turn);
this.movesCount--;
}
+ if (!!move.end.released) this.repetitions.pop();
this.postUndo(move);
}
// Add potential promotion indications:
const firstLastRank = (c == 'w' ? [7, 0] : [0, 7]);
if (move.end.x == firstLastRank[1] && piece == V.PAWN) {
- const up = this.getUnionPieces(move.appear[0].c, move.appear[0].p);
- notation += "=" + up[c].toUpperCase();
+ notation += "=";
+ if (ChessRules.PIECES.includes(move.appear[0].p))
+ notation += move.appear[0].p.toUpperCase();
+ else {
+ const up = this.getUnionPieces(move.appear[0].c, move.appear[0].p);
+ notation += up[c].toUpperCase();
+ }
}
else if (
move.end.x == firstLastRank[0] &&