2693f84fdc82b5960d44f94b37c0a241d41ccdbe
1 import { ChessRules
} from "@/base_rules";
2 import { ArrayFun
} from "@/utils/array";
3 import { shuffle
} from "@/utils/alea";
5 export class SuicideRules
extends ChessRules
{
6 static get HasFlags() {
10 static get PawnSpecs() {
14 { promotions: ChessRules
.PawnSpecs
.promotions
.concat([V
.KING
]) }
18 static IsGoodPosition(position
) {
19 if (position
.length
== 0) return false;
20 const rows
= position
.split("/");
21 if (rows
.length
!= V
.size
.x
) return false;
22 // Just check that at least one piece of each color is there:
23 let pieces
= { "w": 0, "b": 0 };
24 for (let row
of rows
) {
26 for (let i
= 0; i
< row
.length
; i
++) {
27 const lowerRi
= row
[i
].toLowerCase();
28 if (V
.PIECES
.includes(lowerRi
)) {
29 pieces
[row
[i
] == lowerRi
? "b" : "w"]++;
32 const num
= parseInt(row
[i
]);
33 if (isNaN(num
)) return false;
37 if (sumElts
!= V
.size
.y
) return false;
39 if (Object
.values(pieces
).some(v
=> v
== 0)) return false;
45 // Trim all non-capturing moves (not the most efficient, but easy)
46 static KeepCaptures(moves
) {
47 return moves
.filter(m
=> m
.vanish
.length
== 2);
50 // Stop at the first capture found (if any)
52 const color
= this.turn
;
53 const oppCol
= V
.GetOppCol(color
);
54 for (let i
= 0; i
< V
.size
.x
; i
++) {
55 for (let j
= 0; j
< V
.size
.y
; j
++) {
57 this.board
[i
][j
] != V
.EMPTY
&&
58 this.getColor(i
, j
) != oppCol
&&
59 this.getPotentialMovesFrom([i
, j
]).some(m
=> m
.vanish
.length
== 2)
68 getPossibleMovesFrom(sq
) {
69 let moves
= this.getPotentialMovesFrom(sq
);
70 const captureMoves
= V
.KeepCaptures(moves
);
71 if (captureMoves
.length
> 0) return captureMoves
;
72 if (this.atLeastOneCapture()) return [];
81 const moves
= super.getAllValidMoves();
82 if (moves
.some(m
=> m
.vanish
.length
== 2)) return V
.KeepCaptures(moves
);
87 const color
= this.turn
;
88 for (let i
= 0; i
< V
.size
.x
; i
++) {
89 for (let j
= 0; j
< V
.size
.y
; j
++) {
91 this.getColor(i
, j
) == color
&&
92 this.getPotentialMovesFrom([i
, j
]).length
> 0
105 // No variables update because no royal king + no castling
112 if (this.atLeastOneMove()) return "*";
113 // No valid move: the side who cannot move wins
114 return this.turn
== "w" ? "1-0" : "0-1";
117 static get VALUES() {
128 static get SEARCH_DEPTH() {
133 // Less material is better:
134 return -super.evalPosition();
137 static GenRandInitFen(randomness
) {
139 return "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w 0 -";
141 let pieces
= { w: new Array(8), b: new Array(8) };
142 for (let c
of ["w", "b"]) {
143 if (c
== 'b' && randomness
== 1) {
144 pieces
['b'] = pieces
['w'];
148 // Get random squares for every piece, totally freely
149 let positions
= shuffle(ArrayFun
.range(8));
150 const composition
= ['b', 'b', 'r', 'r', 'n', 'n', 'k', 'q'];
151 const rem2
= positions
[0] % 2;
152 if (rem2
== positions
[1] % 2) {
153 // Fix bishops (on different colors)
154 for (let i
=2; i
<8; i
++) {
155 if (positions
[i
] % 2 != rem2
)
156 [positions
[1], positions
[i
]] = [positions
[i
], positions
[1]];
159 for (let i
= 0; i
< 8; i
++) pieces
[c
][positions
[i
]] = composition
[i
];
162 pieces
["b"].join("") +
163 "/pppppppp/8/8/8/8/PPPPPPPP/" +
164 pieces
["w"].join("").toUpperCase() +
165 // En-passant allowed, but no flags