-//https://www.chessvariants.com/large.dir/freeling.html
+// NOTE: initial setup differs from the original; see
+// https://www.chessvariants.com/large.dir/freeling.html
class GrandRules extends ChessRules
{
static getPpath(b)
{
- const V = VariantRules;
return ([V.MARSHALL,V.CARDINAL].includes(b[1]) ? "Grand/" : "") + b;
}
- initVariables(fen)
+ static IsGoodFen(fen)
{
- super.initVariables(fen);
- this.captures = { "w": {}, "b": {} }; //for promotions
+ if (!ChessRules.IsGoodFen(fen))
+ return false;
+ const fenParsed = V.ParseFen(fen);
+ // 5) Check captures
+ if (!fenParsed.captured || !fenParsed.captured.match(/^[0-9]{10,10}$/))
+ return false;
+ return true;
}
- static get size() { return [10,10]; }
+ static GenRandInitFen()
+ {
+ const fen = ChessRules.GenRandInitFen();
+ return fen.replace(" w 1111", " w 1111 0000000000");
+ }
+
+ getFen()
+ {
+ return super.getFen() + " " + this.getCapturedFen();
+ }
+
+ getCapturedFen()
+ {
+ let counts = _.map(_.range(10), 0);
+ for (let i=0; i<V.PIECES.length; i++)
+ {
+ counts[i] = this.captured["w"][V.PIECES[i]];
+ counts[5+i] = this.captured["b"][V.PIECES[i]];
+ }
+ return counts.join("");
+ }
+
+ setOtherVariables(fen)
+ {
+ super.setOtherVariables(fen);
+ const fenParsed = V.ParseFen(fen);
+ // Initialize captured pieces' counts from FEN
+ this.captured =
+ {
+ "w":
+ {
+ [V.PAWN]: parseInt(fenParsed.captured[0]),
+ [V.ROOK]: parseInt(fenParsed.captured[1]),
+ [V.KNIGHT]: parseInt(fenParsed.captured[2]),
+ [V.BISHOP]: parseInt(fenParsed.captured[3]),
+ [V.QUEEN]: parseInt(fenParsed.captured[4]),
+ },
+ "b":
+ {
+ [V.PAWN]: parseInt(fenParsed.captured[5]),
+ [V.ROOK]: parseInt(fenParsed.captured[6]),
+ [V.KNIGHT]: parseInt(fenParsed.captured[7]),
+ [V.BISHOP]: parseInt(fenParsed.captured[8]),
+ [V.QUEEN]: parseInt(fenParsed.captured[9]),
+ }
+ };
+ }
+
+ static get size() { return {x:10,y:10}; }
static get MARSHALL() { return 'm'; } //rook+knight
static get CARDINAL() { return 'c'; } //bishop+knight
+ static get PIECES()
+ {
+ return ChessRules.PIECES.concat([V.MARSHALL,V.CARDINAL]);
+ }
+
+ // There may be 2 enPassant squares (if pawn jump 3 squares)
+ getEnpassantFen()
+ {
+ const L = this.epSquares.length;
+ if (!this.epSquares[L-1])
+ return "-"; //no en-passant
+ let res = "";
+ this.epSquares[L-1].forEach(sq => {
+ res += V.CoordsToSquare(sq) + ",";
+ });
+ return res.slice(0,-1); //remove last comma
+ }
+
// En-passant after 2-sq or 3-sq jumps
- getEpSquare(move)
+ getEpSquare(moveOrSquare)
{
+ if (!moveOrSquare)
+ return undefined;
+ if (typeof moveOrSquare === "string")
+ {
+ const square = moveOrSquare;
+ if (square == "-")
+ return undefined;
+ let res = [];
+ square.split(",").forEach(sq => {
+ res.push(V.SquareToCoords(sq));
+ });
+ return res;
+ }
+ // Argument is a move:
+ const move = moveOrSquare;
const [sx,sy,ex] = [move.start.x,move.start.y,move.end.x];
- if (this.getPiece(sx,sy) == VariantRules.PAWN && Math.abs(sx - ex) >= 2)
+ if (this.getPiece(sx,sy) == V.PAWN && Math.abs(sx - ex) >= 2)
{
const step = (ex-sx) / Math.abs(ex-sx);
let res = [{
{
switch (this.getPiece(x,y))
{
- case VariantRules.MARSHALL:
+ case V.MARSHALL:
return this.getPotentialMarshallMoves([x,y]);
- case VariantRules.CARDINAL:
+ case V.CARDINAL:
return this.getPotentialCardinalMoves([x,y]);
default:
return super.getPotentialMovesFrom([x,y])
{
const color = this.turn;
let moves = [];
- const V = VariantRules;
- const [sizeX,sizeY] = VariantRules.size;
+ const [sizeX,sizeY] = [V.size.x,V.size.y];
const shift = (color == "w" ? -1 : 1);
- const startRanks = (color == "w" ? [sizeY-2,sizeY-3] : [1,2]);
- const lastRanks = (color == "w" ? [0,1,2] : [sizeY-1,sizeY-2,sizeY-3]);
+ const startRanks = (color == "w" ? [sizeX-2,sizeX-3] : [1,2]);
+ const lastRanks = (color == "w" ? [0,1,2] : [sizeX-1,sizeX-2,sizeX-3]);
if (x+shift >= 0 && x+shift < sizeX && x+shift != lastRanks[0])
{
{
// Two squares jump
moves.push(this.getBasicMove([x,y], [x+2*shift,y]));
- if (x == startRanks[0] && this.board[x+2*shift][y] == V.EMPTY)
+ if (x == startRanks[0] && this.board[x+3*shift][y] == V.EMPTY)
{
// 3-squares jump
moves.push(this.getBasicMove([x,y], [x+3*shift,y]));
}
}
// Captures
- if (y>0 && this.canTake([x,y], [x+shift,y-1]) && this.board[x+shift][y-1] != V.EMPTY)
+ if (y>0 && this.canTake([x,y], [x+shift,y-1])
+ && this.board[x+shift][y-1] != V.EMPTY)
+ {
moves.push(this.getBasicMove([x,y], [x+shift,y-1]));
- if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1]) && this.board[x+shift][y+1] != V.EMPTY)
+ }
+ if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
+ && this.board[x+shift][y+1] != V.EMPTY)
+ {
moves.push(this.getBasicMove([x,y], [x+shift,y+1]));
+ }
}
if (lastRanks.includes(x+shift))
{
// Promotion
- let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN];
+ let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN,V.MARSHALL,V.CARDINAL];
promotionPieces.forEach(p => {
- if (!this.captures[color][p] || this.captures[color][p]==0)
+ if (this.captured[color][p]==0)
return;
// Normal move
if (this.board[x+shift][y] == V.EMPTY)
moves.push(this.getBasicMove([x,y], [x+shift,y], {c:color,p:p}));
// Captures
- if (y>0 && this.canTake([x,y], [x+shift,y-1]) && this.board[x+shift][y-1] != V.EMPTY)
+ if (y>0 && this.canTake([x,y], [x+shift,y-1])
+ && this.board[x+shift][y-1] != V.EMPTY)
+ {
moves.push(this.getBasicMove([x,y], [x+shift,y-1], {c:color,p:p}));
- if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1]) && this.board[x+shift][y+1] != V.EMPTY)
+ }
+ if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
+ && this.board[x+shift][y+1] != V.EMPTY)
+ {
moves.push(this.getBasicMove([x,y], [x+shift,y+1], {c:color,p:p}));
+ }
});
}
return moves;
}
+ // TODO: different castle?
+
getPotentialMarshallMoves(sq)
{
- const V = VariantRules;
return this.getSlideNJumpMoves(sq, V.steps[V.ROOK]).concat(
this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
}
getPotentialCardinalMoves(sq)
{
- const V = VariantRules;
return this.getSlideNJumpMoves(sq, V.steps[V.BISHOP]).concat(
this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
}
isAttackedByMarshall(sq, colors)
{
- const V = VariantRules;
return this.isAttackedBySlideNJump(sq, colors, V.MARSHALL, V.steps[V.ROOK])
- || this.isAttackedBySlideNJump(sq, colors, V.MARSHALL, V.steps[V.KNIGHT], "oneStep");
+ || this.isAttackedBySlideNJump(
+ sq, colors, V.MARSHALL, V.steps[V.KNIGHT], "oneStep");
}
isAttackedByCardinal(sq, colors)
{
- const V = VariantRules;
return this.isAttackedBySlideNJump(sq, colors, V.CARDINAL, V.steps[V.BISHOP])
- || this.isAttackedBySlideNJump(sq, colors, V.CARDINAL, V.steps[V.KNIGHT], "oneStep");
+ || this.isAttackedBySlideNJump(
+ sq, colors, V.CARDINAL, V.steps[V.KNIGHT], "oneStep");
}
- play(move, ingame)
+ updateVariables(move)
{
- super.play(move, ingame);
- if (move.vanish.length==2 && move.appear.length==1
- && move.vanish[1].p != VariantRules.PAWN)
+ super.updateVariables(move);
+ if (move.vanish.length==2 && move.appear.length==1 && move.vanish[1].p != V.PAWN)
{
- // Capture: update this.captures
- if (!this.captures[move.vanish[1].c][move.vanish[1].p])
- this.captures[move.vanish[1].c][move.vanish[1].p] = 1;
- else
- this.captures[move.vanish[1].c][move.vanish[1].p]++;
+ // Capture: update this.captured
+ this.captured[move.vanish[1].c][move.vanish[1].p]++;
}
}
- undo(move)
+ unupdateVariables(move)
{
- super.undo(move);
- if (move.vanish.length==2 && move.appear.length==1
- && move.vanish[1].p != VariantRules.PAWN)
- {
- // Capture: update this.captures
- this.captures[move.vanish[1].c][move.vanish[1].p] =
- Math.max(0, this.captures[move.vanish[1].c][move.vanish[1].p]-1);
- }
+ super.unupdateVariables(move);
+ if (move.vanish.length==2 && move.appear.length==1 && move.vanish[1].p != V.PAWN)
+ this.captured[move.vanish[1].c][move.vanish[1].p]--;
}
- static get VALUES() {
+ static get VALUES()
+ {
return Object.assign(
ChessRules.VALUES,
{'c': 5, 'm': 7} //experimental
static get SEARCH_DEPTH() { return 2; }
- // TODO: this function could be generalized and shared better
+ // TODO: this function could be generalized and shared better (how ?!...)
static GenRandInitFen()
{
- let pieces = [new Array(10), new Array(10)];
+ let pieces = { "w": new Array(10), "b": new Array(10) };
// Shuffle pieces on first and last rank
- for (let c = 0; c <= 1; c++)
+ for (let c of ["w","b"])
{
let positions = _.range(10);
pieces[c][knight2Pos] = 'n';
pieces[c][rook2Pos] = 'r';
}
- let fen = pieces[0].join("") +
+ return pieces["b"].join("") +
"/pppppppppp/10/10/10/10/10/10/PPPPPPPPPP/" +
- pieces[1].join("").toUpperCase() +
- " 1111";
- return fen;
+ pieces["w"].join("").toUpperCase() +
+ " w 1111 -";
}
}
+
+const VariantRules = GrandRules;