projects
/
vchess.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Add Perfect Chess, fix a bug in BaseGame when moving while choosing a promotion,...
[vchess.git]
/
client
/
src
/
variants
/
Grand.js
diff --git
a/client/src/variants/Grand.js
b/client/src/variants/Grand.js
index
c4e2eb1
..
f4a96ce
100644
(file)
--- a/
client/src/variants/Grand.js
+++ b/
client/src/variants/Grand.js
@@
-4,11
+4,7
@@
import { randInt } from "@/utils/alea";
// NOTE: initial setup differs from the original; see
// https://www.chessvariants.com/large.dir/freeling.html
// NOTE: initial setup differs from the original; see
// https://www.chessvariants.com/large.dir/freeling.html
-export const VariantRules = class GrandRules extends ChessRules {
- static getPpath(b) {
- return ([V.MARSHALL, V.CARDINAL].includes(b[1]) ? "Grand/" : "") + b;
- }
-
+export class GrandRules extends ChessRules {
static IsGoodFen(fen) {
if (!ChessRules.IsGoodFen(fen)) return false;
const fenParsed = V.ParseFen(fen);
static IsGoodFen(fen) {
if (!ChessRules.IsGoodFen(fen)) return false;
const fenParsed = V.ParseFen(fen);
@@
-35,10
+31,18
@@
export const VariantRules = class GrandRules extends ChessRules {
return Object.assign(ChessRules.ParseFen(fen), { captured: fenParts[5] });
}
return Object.assign(ChessRules.ParseFen(fen), { captured: fenParts[5] });
}
+ getPpath(b) {
+ return ([V.MARSHALL, V.CARDINAL].includes(b[1]) ? "Grand/" : "") + b;
+ }
+
getFen() {
return super.getFen() + " " + this.getCapturedFen();
}
getFen() {
return super.getFen() + " " + this.getCapturedFen();
}
+ getFenForRepeat() {
+ return super.getFenForRepeat() + "_" + this.getCapturedFen();
+ }
+
getCapturedFen() {
let counts = [...Array(14).fill(0)];
let i = 0;
getCapturedFen() {
let counts = [...Array(14).fill(0)];
let i = 0;
@@
-83,12
+87,15
@@
export const VariantRules = class GrandRules extends ChessRules {
return { x: 10, y: 10 };
}
return { x: 10, y: 10 };
}
+ // Rook + knight:
static get MARSHALL() {
return "m";
static get MARSHALL() {
return "m";
- } //rook+knight
+ }
+
+ // Bishop + knight
static get CARDINAL() {
return "c";
static get CARDINAL() {
return "c";
- }
//bishop+knight
+ }
static get PIECES() {
return ChessRules.PIECES.concat([V.MARSHALL, V.CARDINAL]);
static get PIECES() {
return ChessRules.PIECES.concat([V.MARSHALL, V.CARDINAL]);
@@
-219,7
+226,7
@@
export const VariantRules = class GrandRules extends ChessRules {
for (let epsq of epSquare) {
// TODO: some redundant checks
if (epsq.x == x + shiftX && Math.abs(epsq.y - y) == 1) {
for (let epsq of epSquare) {
// TODO: some redundant checks
if (epsq.x == x + shiftX && Math.abs(epsq.y - y) == 1) {
-
var
enpassantMove = this.getBasicMove([x, y], [epsq.x, epsq.y]);
+
let
enpassantMove = this.getBasicMove([x, y], [epsq.x, epsq.y]);
// WARNING: the captured pawn may be diagonally behind us,
// if it's a 3-squares jump and we take on 1st passing square
const px = this.board[x][epsq.y] != V.EMPTY ? x : x - shiftX;
// WARNING: the captured pawn may be diagonally behind us,
// if it's a 3-squares jump and we take on 1st passing square
const px = this.board[x][epsq.y] != V.EMPTY ? x : x - shiftX;
@@
-251,20
+258,20
@@
export const VariantRules = class GrandRules extends ChessRules {
);
}
);
}
- isAttacked(sq, color
s
) {
+ isAttacked(sq, color) {
return (
return (
- super.isAttacked(sq, color
s
) ||
- this.isAttackedByMarshall(sq, color
s
) ||
- this.isAttackedByCardinal(sq, color
s
)
+ super.isAttacked(sq, color) ||
+ this.isAttackedByMarshall(sq, color) ||
+ this.isAttackedByCardinal(sq, color)
);
}
);
}
- isAttackedByMarshall(sq, color
s
) {
+ isAttackedByMarshall(sq, color) {
return (
return (
- this.isAttackedBySlideNJump(sq, color
s
, V.MARSHALL, V.steps[V.ROOK]) ||
+ this.isAttackedBySlideNJump(sq, color, V.MARSHALL, V.steps[V.ROOK]) ||
this.isAttackedBySlideNJump(
sq,
this.isAttackedBySlideNJump(
sq,
- color
s
,
+ color,
V.MARSHALL,
V.steps[V.KNIGHT],
"oneStep"
V.MARSHALL,
V.steps[V.KNIGHT],
"oneStep"
@@
-272,12
+279,12
@@
export const VariantRules = class GrandRules extends ChessRules {
);
}
);
}
- isAttackedByCardinal(sq, color
s
) {
+ isAttackedByCardinal(sq, color) {
return (
return (
- this.isAttackedBySlideNJump(sq, color
s
, V.CARDINAL, V.steps[V.BISHOP]) ||
+ this.isAttackedBySlideNJump(sq, color, V.CARDINAL, V.steps[V.BISHOP]) ||
this.isAttackedBySlideNJump(
sq,
this.isAttackedBySlideNJump(
sq,
- color
s
,
+ color,
V.CARDINAL,
V.steps[V.KNIGHT],
"oneStep"
V.CARDINAL,
V.steps[V.KNIGHT],
"oneStep"
@@
-285,8
+292,8
@@
export const VariantRules = class GrandRules extends ChessRules {
);
}
);
}
-
updateVariables
(move) {
- super.
updateVariables
(move);
+
postPlay
(move) {
+ super.
postPlay
(move);
if (move.vanish.length == 2 && move.appear.length == 1) {
// Capture: update this.captured
this.captured[move.vanish[1].c][move.vanish[1].p]++;
if (move.vanish.length == 2 && move.appear.length == 1) {
// Capture: update this.captured
this.captured[move.vanish[1].c][move.vanish[1].p]++;
@@
-297,8
+304,8
@@
export const VariantRules = class GrandRules extends ChessRules {
}
}
}
}
-
unupdateVariables
(move) {
- super.
unupdateVariables
(move);
+
postUndo
(move) {
+ super.
postUndo
(move);
if (move.vanish.length == 2 && move.appear.length == 1)
this.captured[move.vanish[1].c][move.vanish[1].p]--;
if (move.vanish[0].p != move.appear[0].p)
if (move.vanish.length == 2 && move.appear.length == 1)
this.captured[move.vanish[1].c][move.vanish[1].p]--;
if (move.vanish[0].p != move.appear[0].p)
@@
-307,8
+314,8
@@
export const VariantRules = class GrandRules extends ChessRules {
static get VALUES() {
return Object.assign(
static get VALUES() {
return Object.assign(
- ChessRules.VALUES,
- { c: 5, m: 7 } //experimental
+ { c: 5, m: 7 }, //experimental
+ ChessRules.VALUES
);
}
);
}
@@
-316,10
+323,21
@@
export const VariantRules = class GrandRules extends ChessRules {
return 2;
}
return 2;
}
- static GenRandInitFen() {
+ static GenRandInitFen(randomness) {
+ if (randomness == 0) {
+ // No castling in the official initial setup
+ return "r8r/1nbqkmcbn1/pppppppppp/10/10/10/10/PPPPPPPPPP/1NBQKMCBN1/R8R " +
+ "w 0 zzzz - 00000000000000";
+ }
+
let pieces = { w: new Array(10), b: new Array(10) };
// Shuffle pieces on first and last rank
for (let c of ["w", "b"]) {
let pieces = { w: new Array(10), b: new Array(10) };
// Shuffle pieces on first and last rank
for (let c of ["w", "b"]) {
+ if (c == 'b' && randomness == 1) {
+ pieces['b'] = pieces['w'];
+ break;
+ }
+
let positions = ArrayFun.range(10);
// Get random squares for bishops
let positions = ArrayFun.range(10);
// Get random squares for bishops