import { ArrayFun } from "@/utils/array";
import { randInt } from "@/utils/alea";
-export const VariantRules = class HiddenqueenRules extends ChessRules {
+export class HiddenqueenRules extends ChessRules {
// Analyse in Hiddenqueen mode makes no sense
static get CanAnalyze() {
return false;
}
static get PIECES() {
- return ChessRules.PIECES.concat(Object.values(V.HIDDEN_CODE));
+ return ChessRules.PIECES.concat([V.HIDDEN_QUEEN]);
}
getPiece(i, j) {
const color = move.vanish[0].c;
const pawnShift = color == "w" ? -1 : 1;
const startRank = color == "w" ? V.size.x - 2 : 1;
- const lastRank = color == "w" ? 0 : V.size.x - 1;
return (
- // The queen is discovered if she reaches the 8th rank,
- // even if this would be a technically valid pawn move.
- move.end.x != lastRank &&
(
+ move.end.x - move.start.x == pawnShift &&
(
- move.end.x - move.start.x == pawnShift &&
(
- (
- // Normal move
- move.end.y == move.start.y &&
- this.board[move.end.x][move.end.y] == V.EMPTY
- )
- ||
- (
- // Capture
- Math.abs(move.end.y - move.start.y) == 1 &&
- this.board[move.end.x][move.end.y] != V.EMPTY
- )
+ // Normal move
+ move.end.y == move.start.y &&
+ this.board[move.end.x][move.end.y] == V.EMPTY
+ )
+ ||
+ (
+ // Capture
+ Math.abs(move.end.y - move.start.y) == 1 &&
+ this.board[move.end.x][move.end.y] != V.EMPTY
)
)
- ||
- (
- // Two-spaces initial jump
- move.start.x == startRank &&
- move.end.y == move.start.y &&
- move.end.x - move.start.x == 2 * pawnShift &&
- this.board[move.end.x][move.end.y] == V.EMPTY
- )
+ )
+ ||
+ (
+ // Two-spaces initial jump
+ move.start.x == startRank &&
+ move.end.y == move.start.y &&
+ move.end.x - move.start.x == 2 * pawnShift &&
+ this.board[move.end.x][move.end.y] == V.EMPTY
)
);
}
getPotentialMovesFrom([x, y]) {
if (this.getPiece(x, y) == V.HIDDEN_QUEEN) {
- const pawnMoves = super.getPotentialPawnMoves([x, y]);
+ const pawnMoves = this.getPotentialPawnMoves([x, y]);
let queenMoves = super.getPotentialQueenMoves([x, y]);
// Remove from queen moves those corresponding to a pawn move:
queenMoves = queenMoves
return super.getPotentialMovesFrom([x, y]);
}
+ getPotentialPawnMoves([x, y]) {
+ const piece = this.getPiece(x, y);
+ const promotions =
+ piece == V.PAWN
+ ? [V.ROOK, V.KNIGHT, V.BISHOP, V.QUEEN]
+ : [V.QUEEN]; //hidden queen revealed
+ return super.getPotentialPawnMoves([x, y], promotions);
+ }
+
getPossibleMovesFrom(sq) {
this.side = this.turn;
return this.filterValid(this.getPotentialMovesFrom(sq));
}
- static GenRandInitFen() {
- let fen = ChessRules.GenRandInitFen();
- // Place hidden queens at random:
+ static GenRandInitFen(randomness) {
+ let fen = ChessRules.GenRandInitFen(randomness);
+ // Place hidden queens at random (always):
let hiddenQueenPos = randInt(8);
let pawnRank = "PPPPPPPP".split("");
pawnRank[hiddenQueenPos] = "T";
return fen;
}
- updateVariables(move) {
- super.updateVariables(move);
+ postPlay(move) {
+ super.postPlay(move);
if (move.vanish.length == 2 && move.vanish[1].p == V.KING)
// We took opponent king
this.kingPos[this.turn] = [-1, -1];
}
- unupdateVariables(move) {
- super.unupdateVariables(move);
- const c = move.vanish[0].c;
- const oppCol = V.GetOppCol(c);
+ preUndo(move) {
+ super.preUndo(move);
+ const oppCol = this.turn;
if (this.kingPos[oppCol][0] < 0)
- // Last move took opponent's king:
+ // Move takes opponent's king:
this.kingPos[oppCol] = [move.vanish[1].x, move.vanish[1].y];
}
this.side = this.turn;
return super.getComputerMove();
}
+
+ getNotation(move) {
+ const notation = super.getNotation(move);
+ if (notation.charAt(0) == 'T')
+ // Do not reveal hidden queens
+ return notation.substr(1);
+ return notation;
+ }
};