X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FHiddenqueen.js;h=8db5a50e041e58d3a85502be2370e45c665ab724;hb=32f6285ee325a14286562a53baefc647201df2af;hp=4f66894bff27803812ff4309933c3d31400ece83;hpb=b627d118ab41dccbda68f4523de8f063d0fa89df;p=vchess.git diff --git a/client/src/variants/Hiddenqueen.js b/client/src/variants/Hiddenqueen.js index 4f66894b..8db5a50e 100644 --- a/client/src/variants/Hiddenqueen.js +++ b/client/src/variants/Hiddenqueen.js @@ -2,7 +2,7 @@ import { ChessRules, PiPo, Move } from "@/base_rules"; 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; @@ -42,37 +42,31 @@ export const VariantRules = class HiddenqueenRules extends ChessRules { 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 + ) ); } @@ -93,81 +87,13 @@ export const VariantRules = class HiddenqueenRules extends ChessRules { return super.getPotentialMovesFrom([x, y]); } - // TODO: find a more general way to describe pawn movements to avoid - // re-writing almost the same function for several variants. getPotentialPawnMoves([x, y]) { - const color = this.turn; const piece = this.getPiece(x, y); - let moves = []; - const [sizeX, sizeY] = [V.size.x, V.size.y]; - const shiftX = color == "w" ? -1 : 1; - const startRank = color == "w" ? sizeX - 2 : 1; - const lastRank = color == "w" ? 0 : sizeX - 1; - - const finalPieces = - x + shiftX == lastRank - ? piece == V.PAWN - ? [V.ROOK, V.KNIGHT, V.BISHOP, V.QUEEN] - : [V.QUEEN] //hidden queen revealed - : piece; - if (this.board[x + shiftX][y] == V.EMPTY) { - // One square forward - for (let p of finalPieces) { - moves.push( - this.getBasicMove([x, y], [x + shiftX, y], { - c: color, - p: p - }) - ); - } - if ( - x == startRank && - this.board[x + 2 * shiftX][y] == V.EMPTY - ) { - // Two squares jump - moves.push(this.getBasicMove([x, y], [x + 2 * shiftX, y])); - } - } - // Captures - for (let shiftY of [-1, 1]) { - if ( - y + shiftY >= 0 && - y + shiftY < sizeY && - this.board[x + shiftX][y + shiftY] != V.EMPTY && - this.canTake([x, y], [x + shiftX, y + shiftY]) - ) { - for (let p of finalPieces) { - moves.push( - this.getBasicMove([x, y], [x + shiftX, y + shiftY], { - c: color, - p: p - }) - ); - } - } - } - - if (V.HasEnpassant) { - // En passant - const Lep = this.epSquares.length; - const epSquare = this.epSquares[Lep - 1]; //always at least one element - if ( - !!epSquare && - epSquare.x == x + shiftX && - Math.abs(epSquare.y - y) == 1 - ) { - let enpassantMove = this.getBasicMove([x, y], [epSquare.x, epSquare.y]); - enpassantMove.vanish.push({ - x: x, - y: epSquare.y, - p: "p", - c: this.getColor(x, epSquare.y) - }); - moves.push(enpassantMove); - } - } - - return moves; + 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) { @@ -175,9 +101,9 @@ export const VariantRules = class HiddenqueenRules extends ChessRules { 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"; @@ -189,19 +115,18 @@ export const VariantRules = class HiddenqueenRules extends ChessRules { 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]; }