Debug Knightrelay variant
[vchess.git] / client / src / variants / Upsidedown.js
CommitLineData
0c3fe8a6
BA
1import { ChessRules } from "@/base_rules";
2import { randInt } from "@/utils/alea";
3import { ArrayFun } from "@/utils/array";
4
6808d7a1
BA
5export const VariantRules = class UpsidedownRules extends ChessRules {
6 static get HasFlags() {
7 return false;
8 }
388e4c40 9
6808d7a1
BA
10 static get HasEnpassant() {
11 return false;
12 }
f6dbe8e3 13
6808d7a1 14 getPotentialKingMoves(sq) {
dac39588 15 // No castle
6808d7a1
BA
16 return this.getSlideNJumpMoves(
17 sq,
18 V.steps[V.ROOK].concat(V.steps[V.BISHOP]),
19 "oneStep"
20 );
dac39588 21 }
388e4c40 22
6808d7a1
BA
23 static GenRandInitFen() {
24 let pieces = { w: new Array(8), b: new Array(8) };
25 for (let c of ["w", "b"]) {
dac39588 26 let positions = ArrayFun.range(8);
388e4c40 27
dac39588
BA
28 let randIndex = randInt(8);
29 const kingPos = positions[randIndex];
30 positions.splice(randIndex, 1);
26c1e3bd 31
dac39588
BA
32 // At least a knight must be next to the king:
33 let knight1Pos = undefined;
6808d7a1
BA
34 if (kingPos == 0) knight1Pos = 1;
35 else if (kingPos == V.size.y - 1) knight1Pos = V.size.y - 2;
36 else knight1Pos = kingPos + (Math.random() < 0.5 ? 1 : -1);
dac39588
BA
37 // Search for knight1Pos index in positions and remove it
38 const knight1Index = positions.indexOf(knight1Pos);
39 positions.splice(knight1Index, 1);
26c1e3bd 40
dac39588
BA
41 // King+knight1 are on two consecutive squares: one light, one dark
42 randIndex = 2 * randInt(3);
43 const bishop1Pos = positions[randIndex];
44 let randIndex_tmp = 2 * randInt(3) + 1;
45 const bishop2Pos = positions[randIndex_tmp];
6808d7a1
BA
46 positions.splice(Math.max(randIndex, randIndex_tmp), 1);
47 positions.splice(Math.min(randIndex, randIndex_tmp), 1);
388e4c40 48
dac39588
BA
49 randIndex = randInt(4);
50 const knight2Pos = positions[randIndex];
51 positions.splice(randIndex, 1);
388e4c40 52
dac39588
BA
53 randIndex = randInt(3);
54 const queenPos = positions[randIndex];
55 positions.splice(randIndex, 1);
388e4c40 56
dac39588
BA
57 const rook1Pos = positions[0];
58 const rook2Pos = positions[1];
388e4c40 59
6808d7a1
BA
60 pieces[c][rook1Pos] = "r";
61 pieces[c][knight1Pos] = "n";
62 pieces[c][bishop1Pos] = "b";
63 pieces[c][queenPos] = "q";
64 pieces[c][kingPos] = "k";
65 pieces[c][bishop2Pos] = "b";
66 pieces[c][knight2Pos] = "n";
67 pieces[c][rook2Pos] = "r";
dac39588 68 }
6808d7a1
BA
69 return (
70 pieces["w"].join("").toUpperCase() +
dac39588
BA
71 "/PPPPPPPP/8/8/8/8/pppppppp/" +
72 pieces["b"].join("") +
6808d7a1
BA
73 " w 0"
74 ); //no castle, no en-passant
dac39588 75 }
6808d7a1 76};