import { ChessRules, Move, PiPo } from "@/base_rules";
+import { randInt } from "@/utils/alea";
export class DynamoRules extends ChessRules {
// TODO: later, allow to push out pawns on a and h files
const amove = V.ParseFen(fen).amove;
if (amove != "-") {
const amoveParts = amove.split("/");
- let amove = {
+ let move = {
// No need for start & end
appear: [],
vanish: []
};
[0, 1].map(i => {
- amoveParts[i].split(".").forEach(av => {
- // Format is "bpe3"
- const xy = V.SquareToCoords(av.substr(2));
- move[i == 0 ? "appear" : "vanish"].push(
- new PiPo({
- x: xy.x,
- y: xy.y,
- c: av[0],
- p: av[1]
- })
- );
- });
+ if (amoveParts[i] != "-") {
+ amoveParts[i].split(".").forEach(av => {
+ // Format is "bpe3"
+ const xy = V.SquareToCoords(av.substr(2));
+ move[i == 0 ? "appear" : "vanish"].push(
+ new PiPo({
+ x: xy.x,
+ y: xy.y,
+ c: av[0],
+ p: av[1]
+ })
+ );
+ });
+ }
});
this.amoves.push(move);
}
+ this.subTurn = 1;
// Stack "first moves" (on subTurn 1) to merge and check opposite moves
this.firstMove = [];
}
static IsGoodFen(fen) {
if (!ChessRules.IsGoodFen(fen)) return false;
const fenParts = fen.split(" ");
- if (fenParts.length != 6) return false;
- if (fenParts[5] != "-" && !fenParts[5].match(/^([a-h][1-8]){2}$/))
- return false;
+ if (fenParts.length != 5) return false;
+ if (fenParts[4] != "-") {
+ // TODO: a single regexp instead.
+ // Format is [bpa2[.wpd3]] || '-'/[bbc3[.wrd5]] || '-'
+ const amoveParts = fenParts[4].split("/");
+ if (amoveParts.length != 2) return false;
+ for (let part of amoveParts) {
+ if (part != "-") {
+ for (let psq of part.split("."))
+ if (!psq.match(/^[a-r]{3}[1-8]$/)) return false;
+ }
+ }
+ }
return true;
}
getAmoveFen() {
const L = this.amoves.length;
+ if (L == 0) return "-";
return (
["appear","vanish"].map(
mpart => {
+ if (mpart.length == 0) return "-";
return (
this.amoves[L-1][mpart].map(
av => {
return false;
}
- // "pa": piece (as a square) doing this push/pull action
- getActionMoves([sx, sy], [ex, ey], pa) {
- const color = this.getColor(sx, sy);
- const lastRank = (color == 'w' ? 0 : 7);
- const piece = this.getPiece(sx, sy);
+ // Step is right, just add (push/pull) moves in this direction
+ // Direction is assumed normalized.
+ getMovesInDirection([x, y], [dx, dy], nbSteps) {
+ nbSteps = nbSteps || 8; //max 8 steps anyway
+ let [i, j] = [x + dx, y + dy];
let moves = [];
- if (ex == lastRank && piece == V.PAWN) {
- // Promotion by push or pull
- V.PawnSpecs.promotions.forEach(p => {
- let move = super.getBasicMove([sx, sy], [ex, ey], { c: color, p: p });
- moves.push(move);
- });
- } else moves.push(super.getBasicMove([sx, sy], [ex, ey]));
+ const color = this.getColor(x, y);
+ const piece = this.getPiece(x, y);
+ const lastRank = (color == 'w' ? 0 : 7);
+ let counter = 1;
+ while (V.OnBoard(i, j) && this.board[i][j] == V.EMPTY) {
+ if (i == lastRank && piece == V.PAWN) {
+ // Promotion by push or pull
+ V.PawnSpecs.promotions.forEach(p => {
+ let move = super.getBasicMove([x, y], [i, j], { c: color, p: p });
+ moves.push(move);
+ });
+ }
+ else moves.push(super.getBasicMove([x, y], [i, j]));
+ if (++counter > nbSteps) break;
+ i += dx;
+ j += dy;
+ }
+ if (!V.OnBoard(i, j) && piece != V.KING) {
+ // Add special "exit" move, by "taking king"
+ moves.push(
+ new Move({
+ start: { x: x, y: y },
+ end: { x: this.kingPos[color][0], y: this.kingPos[color][1] },
+ appear: [],
+ vanish: [{ x: x, y: y, c: color, p: piece }]
+ })
+ );
+ }
return moves;
}
- // Actions on piece on square "sq", by color "color"
- // NOTE: to push a piece out of the board, make it slide until our piece
- // (doing the action, moving or not)
- getPactions(sq, color) {
- const [x, y] = sq;
- let moves = [];
- let squares = {};
- const oppCol = V.GetOppCol(color);
- // Look in all directions for a "color" piece
- for (let step of V.steps[V.KNIGHT]) {
- const xx = x + step[0],
- yy = y + step[1];
- if (
- V.OnBoard(xx, yy) &&
- this.getPiece(xx, yy) == V.KNIGHT &&
- this.getColor(xx, yy) == color
- ) {
- const px = x - step[0],
- py = y - step[1];
- if (V.OnBoard(px, py)) {
- if (this.board[px][py] == V.EMPTY) {
- const hash = "s" + px + py;
- if (!squares[hash]) {
- squares[hash] = true;
- Array.prototype.push.apply(
- moves,
- this.getActionMoves([x, y], [px, py], [xx, yy])
- );
- }
- else { //add piece doing action
- }
- }
- } else {
- const hash = "s" + xx + yy;
- if (!squares[hash]) {
- squares[hash] = true;
- moves.push(
- new Move({
- start: { x: x, y: y },
- end: { x: xx, y: yy },
- appear: [],
- vanish: [
- new PiPo({
- x: x,
- y: y,
- p: this.getPiece(x, y),
- c: oppCol
- })
- ]
- })
- );
- }
- }
+ // Normalize direction to know the step
+ getNormalizedDirection([dx, dy]) {
+ const absDir = [Math.abs(dx), Math.abs(dy)];
+ let divisor = 0;
+ if (absDir[0] != 0 && absDir[1] != 0 && absDir[0] != absDir[1])
+ // Knight
+ divisor = Math.min(absDir[0], absDir[1]);
+ else
+ // Standard slider (or maybe a pawn or king: same)
+ divisor = Math.max(absDir[0], absDir[1]);
+ return [dx / divisor, dy / divisor];
+ }
+
+ // There was something on x2,y2, maybe our color, pushed/pulled.
+ // Also, the pushed/pulled piece must exit the board.
+ isAprioriValidExit([x1, y1], [x2, y2], color2) {
+ const color1 = this.getColor(x1, y1);
+ const pawnShift = (color1 == 'w' ? -1 : 1);
+ const lastRank = (color1 == 'w' ? 0 : 7);
+ const deltaX = Math.abs(x1 - x2);
+ const deltaY = Math.abs(y1 - y2);
+ const checkSlider = () => {
+ const dir = this.getNormalizedDirection([x2 - x1, y2 - y1]);
+ let [i, j] = [x1 + dir[0], y1 + dir[1]];
+ while (V.OnBoard(i, j) && this.board[i][j] == V.EMPTY) {
+ i += dir[0];
+ j += dir[1];
}
+ return !V.OnBoard(i, j);
+ };
+ switch (this.getPiece(x1, y1)) {
+ case V.PAWN:
+ return (
+ x1 + pawnShift == x2 &&
+ (
+ (color1 == color2 && x2 == lastRank && y1 == y2) ||
+ (color1 != color2 && deltaY == 1 && !V.OnBoard(x2, 2 * y2 - y1))
+ )
+ );
+ case V.ROOK:
+ if (x1 != x2 && y1 != y2) return false;
+ return checkSlider();
+ case V.KNIGHT:
+ return (
+ deltaX + deltaY == 3 &&
+ (deltaX == 1 || deltaY == 1) &&
+ !V.OnBoard(2 * x2 - x1, 2 * y2 - y1)
+ );
+ case V.BISHOP:
+ if (deltaX != deltaY) return false;
+ return checkSlider();
+ case V.QUEEN:
+ if (deltaX != 0 && deltaY != 0 && deltaX != deltaY) return false;
+ return checkSlider();
+ case V.KING:
+ return (
+ deltaX <= 1 &&
+ deltaY <= 1 &&
+ !V.OnBoard(2 * x2 - x1, 2 * y2 - y1)
+ );
}
- for (let step in V.steps[V.ROOK]) {
- // (+ if color is ours, pawn pushes) king, rook and queen
- // --> pawns special case can push from a little distance if on 2nd rank (or 1st rank)
- }
- for (let step in V.steps[V.BISHOP]) {
- // King, bishop, queen, and possibly pawns attacks (if color is enemy)
- }
- return moves;
+ return false;
}
// NOTE: for pushes, play the pushed piece first.
// for pulls: play the piece doing the action first
- // If castle, then no options available next (just re-click)
+ // NOTE: to push a piece out of the board, make it slide until its king
getPotentialMovesFrom([x, y]) {
const color = this.turn;
if (this.subTurn == 1) {
- // Free to play any move or action:
- return (
- super.getPotentialMovesFrom([x, y])
- .concat(this.getPactions([x, y], color))
- );
+ const getMoveHash = (m) => {
+ return V.CoordsToSquare(m.start) + V.CoordsToSquare(m.end);
+ };
+ const addMoves = (dir, nbSteps) => {
+ const newMoves =
+ this.getMovesInDirection([x, y], [-dir[0], -dir[1]], nbSteps)
+ .filter(m => !movesHash[getMoveHash(m)]);
+ newMoves.forEach(m => { movesHash[getMoveHash(m)] = true; });
+ Array.prototype.push.apply(moves, newMoves);
+ };
+ // Free to play any move (if piece of my color):
+ const moves =
+ this.getColor(x, y) == color
+ ? super.getPotentialMovesFrom([x, y])
+ : [];
+ const pawnShift = (color == 'w' ? -1 : 1);
+ const pawnStartRank = (color == 'w' ? 6 : 1);
+ // Structure to avoid adding moves twice (can be action & move)
+ let movesHash = {};
+ moves.forEach(m => { movesHash[getMoveHash(m)] = true; });
+ // [x, y] is pushed by 'color'
+ for (let step of V.steps[V.KNIGHT]) {
+ const [i, j] = [x + step[0], y + step[1]];
+ if (
+ V.OnBoard(i, j) &&
+ this.board[i][j] != V.EMPTY &&
+ this.getColor(i, j) == color &&
+ this.getPiece(i, j) == V.KNIGHT
+ ) {
+ addMoves(step, 1);
+ }
+ }
+ for (let step of V.steps[V.ROOK].concat(V.steps[V.BISHOP])) {
+ let [i, j] = [x + step[0], y + step[1]];
+ while (V.OnBoard(i, j) && this.board[i][j] == V.EMPTY) {
+ i += step[0];
+ j += step[1];
+ }
+ if (
+ V.OnBoard(i, j) &&
+ this.board[i][j] != V.EMPTY &&
+ this.getColor(i, j) == color
+ ) {
+ const deltaX = Math.abs(i - x);
+ const deltaY = Math.abs(j - y);
+ // Can a priori go both ways, except with pawns
+ switch (this.getPiece(i, j)) {
+ case V.PAWN:
+ if (
+ (x - i) / deltaX == pawnShift &&
+ deltaX <= 2 &&
+ deltaY <= 1
+ ) {
+ const pColor = this.getColor(x, y);
+ if (pColor == color && deltaY == 0) {
+ // Pushed forward
+ const maxSteps = (i == pawnStartRank && deltaX == 1 ? 2 : 1);
+ addMoves(step, maxSteps);
+ }
+ else if (pColor != color && deltaY == 1 && deltaX == 1)
+ // Pushed diagonally
+ addMoves(step, 1);
+ }
+ break;
+ case V.ROOK:
+ if (deltaX == 0 || deltaY == 0) addMoves(step);
+ break;
+ case V.BISHOP:
+ if (deltaX == deltaY) addMoves(step);
+ break;
+ case V.QUEEN:
+ if (deltaX == 0 || deltaY == 0 || deltaX == deltaY)
+ addMoves(step);
+ break;
+ case V.KING:
+ if (deltaX <= 1 && deltaY <= 1) addMoves(step, 1);
+ break;
+ }
+ }
+ }
+ return moves;
}
// If subTurn == 2 then we should have a first move,
- // which restrict what we can play now.
- // Case 1: an opponent's piece moved: we can only move the piece which
- // did the action, in the moving direction.
- // Case 2: one of our pieces moved: either by action or by itself.
- // Just check if it could be a normal move. If yes, allow both.
+ // which restrict what we can play now: only in the first move direction
+ // NOTE: no need for knight or pawn checks, because the move will be
+ // naturally limited in those cases.
const L = this.firstMove.length;
const fm = this.firstMove[L-1];
- if (fm.vanish[0].c != color) {
- // Case 1: TODO
+ if (fm.appear.length == 2 && fm.vanish.length == 2)
+ // Castle: no real move playable then.
+ return [];
+ if (fm.appear.length == 0) {
+ // Piece at subTurn 1 just exited the board.
+ // Can I be a piece which caused the exit?
+ if (
+ this.isAprioriValidExit(
+ [x, y],
+ [fm.start.x, fm.start.y],
+ fm.vanish[0].c
+ )
+ ) {
+ // Seems so:
+ const dir = this.getNormalizedDirection(
+ [fm.start.x - x, fm.start.y - y]);
+ return this.getMovesInDirection([x, y], dir);
+ }
}
else {
- // Case 2: TODO
- // Use fm.start.x, fm.start.y, fm.end.x, fm.end.y, fm.vanish[0].c
- // Search for the piece doing the action "pa": the action type
- // is deduced from pa relative positon then.
+ const dirM = this.getNormalizedDirection(
+ [fm.end.x - fm.start.x, fm.end.y - fm.start.y]);
+ const dir = this.getNormalizedDirection(
+ [fm.start.x - x, fm.start.y - y]);
+ // Normalized directions should match
+ if (dir[0] == dirM[0] && dir[1] == dirM[1]) {
+ // And nothing should stand between [x, y] and the square fm.start
+ let [i, j] = [x + dir[0], y + dir[1]];
+ while (
+ (i != fm.start.x || j != fm.start.y) &&
+ this.board[i][j] == V.EMPTY
+ ) {
+ i += dir[0];
+ j += dir[1];
+ }
+ if (i == fm.start.x && j == fm.start.y)
+ return this.getMovesInDirection([x, y], dir);
+ }
}
+ return [];
}
// Does m2 un-do m1 ? (to disallow undoing actions)
let res = this.underCheck(color);
if (res) {
const moves2 = this.getAllPotentialMoves();
- for (m2 of moves2) {
+ for (let m2 of moves2) {
this.play(m2);
const res2 = this.underCheck(color);
this.undo(m2);
this.getPiece(rx, ry) == piece &&
this.getColor(rx, ry) == color
) {
- // Now step in the other direction: if end of the world, then attacked
+ // Continue some steps in the same direction (pull)
+ rx += step[0];
+ ry += step[1];
+ while (
+ V.OnBoard(rx, ry) &&
+ this.board[rx][ry] == V.EMPTY &&
+ !oneStep
+ ) {
+ rx += step[0];
+ ry += step[1];
+ }
+ if (!V.OnBoard(rx, ry)) return true;
+ // Step in the other direction (push)
rx = x - step[0];
ry = y - step[1];
while (
isAttackedByPawn([x, y], color) {
const lastRank = (color == 'w' ? 0 : 7);
- if (y != lastRank)
+ if (x != lastRank)
// The king can be pushed out by a pawn only on last rank
return false;
const pawnShift = (color == "w" ? 1 : -1);
}
doClick(square) {
- // If subTurn == 2 && square is the final square of last move,
- // then return an empty move
- const L = this.firstMove.length;
+ // If subTurn == 2 && square is empty && !underCheck,
+ // then return an empty move, allowing to "pass" subTurn2
if (
this.subTurn == 2 &&
- square.x == this.firstMove[L-1].end.x &&
- square.y == this.firstMove[L-1].end.y
+ this.board[square[0]][square[1]] == V.EMPTY &&
+ !this.underCheck(this.turn)
) {
return {
+ start: { x: -1, y: -1 },
+ end: { x: -1, y: -1 },
appear: [],
vanish: []
};
move.flags = JSON.stringify(this.aggregateFlags());
V.PlayOnBoard(this.board, move);
if (this.subTurn == 2) {
+ const L = this.firstMove.length;
+ this.amoves.push(this.getAmove(this.firstMove[L-1], move));
this.turn = V.GetOppCol(this.turn);
this.movesCount++;
}
this.postPlay(move);
}
- updateCastleFlags(move, piece) {
- const c = V.GetOppCol(this.turn);
- const firstRank = (c == "w" ? V.size.x - 1 : 0);
- // Update castling flags
- if (piece == V.KING) this.castleFlags[c] = [V.size.y, V.size.y];
+ postPlay(move) {
+ if (move.start.x < 0) return;
+ for (let a of move.appear)
+ if (a.p == V.KING) this.kingPos[a.c] = [a.x, a.y];
+ this.updateCastleFlags(move);
+ }
+
+ updateCastleFlags(move) {
+ const firstRank = { 'w': V.size.x - 1, 'b': 0 };
for (let v of move.vanish) {
- if (v.x == firstRank && this.castleFlags[c].includes(v.y)) {
- const flagIdx = (v.y == this.castleFlags[c][0] ? 0 : 1);
- this.castleFlags[c][flagIdx] = V.size.y;
+ if (v.p == V.KING) this.castleFlags[v.c] = [V.size.y, V.size.y];
+ else if (v.x == firstRank[v.c] && this.castleFlags[v.c].includes(v.y)) {
+ const flagIdx = (v.y == this.castleFlags[v.c][0] ? 0 : 1);
+ this.castleFlags[v.c][flagIdx] = V.size.y;
}
}
}
this.subTurn = 3 - this.subTurn;
this.postUndo(move);
}
+
+ postUndo(move) {
+ // (Potentially) Reset king position
+ for (let v of move.vanish)
+ if (v.p == V.KING) this.kingPos[v.c] = [v.x, v.y];
+ }
+
+ getComputerMove() {
+ let moves = this.getAllValidMoves();
+ if (moves.length == 0) return null;
+ // "Search" at depth 1 for now
+ const maxeval = V.INFINITY;
+ const color = this.turn;
+ const emptyMove = {
+ start: { x: -1, y: -1 },
+ end: { x: -1, y: -1 },
+ appear: [],
+ vanish: []
+ };
+ moves.forEach(m => {
+ this.play(m);
+ m.eval = (color == "w" ? -1 : 1) * maxeval;
+ const moves2 = this.getAllValidMoves().concat([emptyMove]);
+ m.next = moves2[0];
+ moves2.forEach(m2 => {
+ this.play(m2);
+ const score = this.getCurrentScore();
+ let mvEval = 0;
+ if (score != "1/2") {
+ if (score != "*") mvEval = (score == "1-0" ? 1 : -1) * maxeval;
+ else mvEval = this.evalPosition();
+ }
+ if (
+ (color == 'w' && mvEval > m.eval) ||
+ (color == 'b' && mvEval < m.eval)
+ ) {
+ m.eval = mvEval;
+ m.next = m2;
+ }
+ this.undo(m2);
+ });
+ this.undo(m);
+ });
+ moves.sort((a, b) => {
+ return (color == "w" ? 1 : -1) * (b.eval - a.eval);
+ });
+ let candidates = [0];
+ for (let i = 1; i < moves.length && moves[i].eval == moves[0].eval; i++)
+ candidates.push(i);
+ const mIdx = candidates[randInt(candidates.length)];
+ const move2 = moves[mIdx].next;
+ delete moves[mIdx]["next"];
+ return [moves[mIdx], move2];
+ }
+
+ getNotation(move) {
+ if (move.start.x < 0)
+ // A second move is always required, but may be empty
+ return "-";
+ const initialSquare = V.CoordsToSquare(move.start);
+ const finalSquare = V.CoordsToSquare(move.end);
+ if (move.appear.length == 0)
+ // Pushed or pulled out of the board
+ return initialSquare + "R";
+ return move.appear[0].p.toUpperCase() + initialSquare + finalSquare;
+ }
};
projects / vchess.git / blobdiff