X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FRococo.js;h=6af29c0555dde5d3188d8f12caebc7e46eedebfe;hb=27ebf6afe4671ce23758724d308b2f9cf2b5b815;hp=8489ae903248e725bf7ede90bc5bd517860b26b2;hpb=2f8dce6a81063289d9d4cbca7971f80b1b194b84;p=vchess.git diff --git a/client/src/variants/Rococo.js b/client/src/variants/Rococo.js index 8489ae90..6af29c05 100644 --- a/client/src/variants/Rococo.js +++ b/client/src/variants/Rococo.js @@ -3,6 +3,7 @@ import { ArrayFun } from "@/utils/array"; import { shuffle } from "@/utils/alea"; export class RococoRules extends ChessRules { + static get HasFlags() { return false; } @@ -15,6 +16,15 @@ export class RococoRules extends ChessRules { return ChessRules.PIECES.concat([V.IMMOBILIZER]); } + static get Lines() { + return [ + [[1, 1], [1, 9]], + [[1, 9], [9, 9]], + [[9, 9], [9, 1]], + [[9, 1], [1, 1]] + ]; + } + getPpath(b) { if (b[1] == "m") //'m' for Immobilizer (I is too similar to 1) @@ -45,7 +55,7 @@ export class RococoRules extends ChessRules { 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; } } @@ -131,8 +141,10 @@ export class RococoRules extends ChessRules { getPotentialMovesFrom([x, y]) { // Pre-check: is thing on this square immobilized? const imSq = this.isImmobilized([x, y]); + const piece = this.getPiece(x, y); if (!!imSq) { - // Only option is suicide: + if (piece == V.KING) return []; + // Only option is suicide, if I'm not a king: return [ new Move({ start: { x: x, y: y }, @@ -150,7 +162,7 @@ export class RococoRules extends ChessRules { ]; } let moves = []; - switch (this.getPiece(x, y)) { + switch (piece) { case V.IMMOBILIZER: moves = this.getPotentialImmobilizerMoves([x, y]); break; @@ -279,13 +291,12 @@ export class RococoRules extends ChessRules { return super.getPotentialQueenMoves(sq).concat(this.getRookCaptures(sq)); } - getKnightCaptures(startSquare, byChameleon) { + getKnightCaptures([x, y], byChameleon) { // Look in every direction for captures const steps = V.steps[V.ROOK].concat(V.steps[V.BISHOP]); const color = this.turn; const oppCol = V.GetOppCol(color); let moves = []; - const [x, y] = [startSquare[0], startSquare[1]]; const piece = this.getPiece(x, y); //might be a chameleon! outerLoop: for (let step of steps) { let [i, j] = [x + step[0], y + step[1]]; @@ -325,7 +336,8 @@ export class RococoRules extends ChessRules { //TODO: redundant test continue outerLoop; } - } else { + } + else { moves.push( new Move({ appear: [new PiPo({ x: cur[0], y: cur[1], c: color, p: piece })], @@ -623,7 +635,7 @@ export class RococoRules extends ChessRules { static GenRandInitFen(randomness) { if (randomness == 0) { return ( - "91/1rnbkqbnm1/1pppppppp1/91/91/91/91/1PPPPPPPP1/1MNBQKBNR1/91 w 0 -" + "91/1rqnbknqm1/1pppppppp1/91/91/91/91/1PPPPPPPP1/1MQNBKNQR1/91 w 0 -" ); } @@ -704,11 +716,15 @@ export class RococoRules extends ChessRules { if (move.appear[0].p == V.PAWN) { // Pawn: generally ambiguous short notation, so we use full description notation = "P" + initialSquare + finalSquare; - } else if (move.appear[0].p == V.KING) + } + else if (move.appear[0].p == V.KING) notation = "K" + (move.vanish.length > 1 ? "x" : "") + finalSquare; - else notation = move.appear[0].p.toUpperCase() + finalSquare; - // Add a capture mark (not describing what is captured...): - if (move.vanish.length > 1 && move.appear[0].p != V.KING) notation += "X"; + else { + notation = move.appear[0].p.toUpperCase() + finalSquare; + // Add a capture mark (not describing what is captured...): + if (move.vanish.length > 1) notation += "X"; + } return notation; } + };