import { shuffle } from "@/utils/alea";
export class BaroqueRules extends ChessRules {
+
static get HasFlags() {
return false;
}
this.kingPos["w"] = [i, k];
break;
default: {
- const num = parseInt(position[i].charAt(j));
+ const num = parseInt(position[i].charAt(j), 10);
if (!isNaN(num)) k += num - 1;
}
}
}
}
- getSlideNJumpMoves([x, y], steps, oneStep) {
- const piece = this.getPiece(x, y);
- let moves = [];
- outerLoop: for (let step of steps) {
- let i = x + step[0];
- let j = y + step[1];
- while (V.OnBoard(i, j) && this.board[i][j] == V.EMPTY) {
- moves.push(this.getBasicMove([x, y], [i, j]));
- if (oneStep !== undefined) continue outerLoop;
- i += step[0];
- j += step[1];
- }
- // Only king can take on occupied square:
- if (piece == V.KING && V.OnBoard(i, j) && this.canTake([x, y], [i, j]))
- moves.push(this.getBasicMove([x, y], [i, j]));
- }
- return moves;
+ canTake([x1, y1], [x2, y2]) {
+ return (
+ this.getPiece(x1, y1) == V.KING &&
+ this.getColor(x1, y1) != this.getColor(x2, y2)
+ );
}
// Modify capturing moves among listed pawn moves
mergedMoves[key].vanish.push(m.vanish[i]);
}
});
- // Finally return an array
- moves = [];
- Object.keys(mergedMoves).forEach(k => {
- moves.push(mergedMoves[k]);
- });
- return moves;
+ return Object.values(mergedMoves);
}
addQueenCaptures(moves, byChameleon) {
if (
(sameRow && move.end.y == y) ||
(sameColumn && move.end.x == x)
- )
+ ) {
return true;
+ }
}
}
}
if (
this.getPiece(i, j) == V.KNIGHT &&
!this.isImmobilized([i, j])
- )
+ ) {
return true;
+ }
continue outerLoop;
}
// [else] Our color,
V.OnBoard(i, j) &&
this.board[i][j] != V.EMPTY &&
this.getColor(i, j) == color &&
- this.getPiece(i, j) == V.BISHOP
+ this.getPiece(i, j) == V.BISHOP &&
+ !this.isImmobilized([i, j])
) {
- return true; //bishops are never immobilized
+ return true;
}
}
return false;
return false;
}
- static get VALUES() {
- return {
- p: 1,
- r: 2,
- n: 5,
- b: 3,
- q: 3,
- m: 5,
- k: 1000
- };
- }
-
- static get SEARCH_DEPTH() {
- return 2;
- }
-
- static GenRandInitFen(randomness) {
- if (randomness == 0)
+ static GenRandInitFen(options) {
+ if (options.randomness == 0)
// Deterministic:
- return "rnbqkbnrm/pppppppp/8/8/8/8/PPPPPPPP/MNBKQBNR w 0";
+ return "rnbkqbnm/pppppppp/8/8/8/8/PPPPPPPP/MNBQKBNR w 0";
let pieces = { w: new Array(8), b: new Array(8) };
// Shuffle pieces on first and last rank
for (let c of ["w", "b"]) {
- if (c == 'b' && randomness == 1) {
+ if (c == 'b' && options.randomness == 1) {
pieces['b'] = pieces['w'];
break;
}
);
}
+ static get VALUES() {
+ return {
+ p: 1,
+ r: 2,
+ n: 5,
+ b: 3,
+ q: 3,
+ m: 5,
+ k: 1000
+ };
+ }
+
+ static get SEARCH_DEPTH() {
+ return 2;
+ }
+
getNotation(move) {
const initialSquare = V.CoordsToSquare(move.start);
const finalSquare = V.CoordsToSquare(move.end);
if (move.vanish.length > 1 && move.appear[0].p != V.KING) notation += "X";
return notation;
}
+
};