X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FWildebeest.js;h=565f6275af953cac7924e68f4389262edef019b0;hb=7ba4a5bc5b64e19a1e7f26aa232d5c50770d07ad;hp=933abbde126aa091714f14785e2dfcf3d9c40409;hpb=6808d7a16ec1e761c6a2dffec2281c96953e4d89;p=vchess.git diff --git a/client/src/variants/Wildebeest.js b/client/src/variants/Wildebeest.js index 933abbde..565f6275 100644 --- a/client/src/variants/Wildebeest.js +++ b/client/src/variants/Wildebeest.js @@ -3,10 +3,6 @@ import { ArrayFun } from "@/utils/array"; import { sample, randInt } from "@/utils/alea"; export const VariantRules = class WildebeestRules extends ChessRules { - static getPpath(b) { - return ([V.CAMEL, V.WILDEBEEST].includes(b[1]) ? "Wildebeest/" : "") + b; - } - static get size() { return { x: 10, y: 11 }; } @@ -52,6 +48,10 @@ export const VariantRules = class WildebeestRules extends ChessRules { return true; } + getPpath(b) { + return ([V.CAMEL, V.WILDEBEEST].includes(b[1]) ? "Wildebeest/" : "") + b; + } + // There may be 2 enPassant squares (if pawn jump 3 squares) getEnpassantFen() { const L = this.epSquares.length; @@ -117,8 +117,9 @@ export const VariantRules = class WildebeestRules extends ChessRules { const shiftX = color == "w" ? -1 : 1; const startRanks = color == "w" ? [sizeX - 2, sizeX - 3] : [1, 2]; const lastRank = color == "w" ? 0 : sizeX - 1; - const finalPieces = - x + shiftX == lastRank ? [V.ROOK, V.KNIGHT, V.BISHOP, V.QUEEN] : [V.PAWN]; + const finalPieces = x + shiftX == lastRank + ? [V.WILDEBEEST, V.QUEEN] + : [V.PAWN]; if (this.board[x + shiftX][y] == V.EMPTY) { // One square forward @@ -234,8 +235,8 @@ export const VariantRules = class WildebeestRules extends ChessRules { static get VALUES() { return Object.assign( - ChessRules.VALUES, - { c: 3, w: 7 } //experimental + { c: 3, w: 7 }, //experimental + ChessRules.VALUES ); } @@ -243,9 +244,18 @@ export const VariantRules = class WildebeestRules extends ChessRules { return 2; } - static GenRandInitFen() { + static GenRandInitFen(randomness) { + if (!randomness) randomness = 2; + if (randomness == 0) + return "rnccwkqbbnr/ppppppppppp/11/11/11/11/11/11/PPPPPPPPPPP/RNBBQKWCCNR w 0 1111 -"; + let pieces = { w: new Array(10), b: new Array(10) }; for (let c of ["w", "b"]) { + if (c == 'b' && randomness == 1) { + pieces['b'] = pieces['w']; + break; + } + let positions = ArrayFun.range(11); // Get random squares for bishops + camels (different colors) @@ -263,7 +273,7 @@ export const VariantRules = class WildebeestRules extends ChessRules { for (let idx of randIndexes.concat(randIndexes_tmp).sort((a, b) => { return b - a; })) { - //largest indices first + // Largest indices first positions.splice(idx, 1); }