[vchess.git] / client / src / variants / Allmate1.js

import { ChessRules, PiPo, Move } from "@/base_rules";

export class Allmate1Rules extends ChessRules {
  static get HasEnpassant() {
    return false;
  }

  getCheckSquares() {
    // No notion of check
    return [];
  }

  static GenRandInitFen(randomness) {
    return ChessRules.GenRandInitFen(randomness).slice(0, -2);
  }

  getPotentialMovesFrom([x, y]) {
    let moves = super.getPotentialMovesFrom([x, y]);
    // Remove standard captures (without removing castling):
    moves = moves.filter(m => {
      return m.vanish.length == 1 || m.appear.length == 2;
    });

    // Augment moves with "mate-captures":
    // TODO: this is coded in a highly inefficient way...
    const color = this.turn;
    const oppCol = V.GetOppCol(this.turn);
    moves.forEach(m => {
      this.play(m);
      let allAttacks = [];

      // While something has been captured:
      // remove it, and keep looking for captures
      outerLoop: while (true) {

        // 1) What is attacked?
        let attacked = {};
        for (let i=0; i<V.size.x; i++) {
          for (let j=0; j<V.size.y; j++) {
            if (this.getColor(i,j) == oppCol && this.isAttacked([i,j], color))
              attacked[i+"_"+j] = [i,j];
          }
        }
        if (Object.keys(attacked).length == 0) break outerLoop;

        // 2) Among attacked pieces, which cannot escape capture?
        // Avoid "oppMoves = this.getAllValidMoves();" => infinite recursion
        for (let i=0; i<V.size.x; i++) {
          for (let j=0; j<V.size.y; j++) {
            if (this.getColor(i,j) == oppCol) {
              let oppMoves = [];
              switch (this.getPiece(i, j)) {
                case V.PAWN:
                  oppMoves = this.getPotentialPawnMoves([i, j]);
                  break;
                case V.ROOK:
                  oppMoves = this.getPotentialRookMoves([i, j]);
                  break;
                case V.KNIGHT:
                  oppMoves = this.getPotentialKnightMoves([i, j]);
                  break;
                case V.BISHOP:
                  oppMoves = this.getPotentialBishopMoves([i, j]);
                  break;
                case V.QUEEN:
                  oppMoves = this.getPotentialQueenMoves([i, j]);
                  break;
                case V.KING:
                  // Do not allow castling to escape from check
                  oppMoves = super.getSlideNJumpMoves(
                    [i, j],
                    V.steps[V.ROOK].concat(V.steps[V.BISHOP]),
                    "oneStep"
                  );
                  break;
              }
              for (let om of oppMoves) {
                V.PlayOnBoard(this.board, om);
                Object.values(attacked).forEach(sq => {
                  const origSq = [sq[0], sq[1]];
                  if (om.start.x == sq[0] && om.start.y == sq[1])
                    // Piece moved:
                    sq = [om.appear[0].x, om.appear[0].y];
                  if (!this.isAttacked(sq, color))
                    delete attacked[origSq[0]+"_"+origSq[1]];
                });
                V.UndoOnBoard(this.board, om);
                if (Object.keys(attacked).length == 0)
                  // No need to explore more moves
                  break outerLoop;
              }
            }
          }
        }

        // 3) Add mate-captures and remove pieces from board:
        Object.keys(attacked).forEach(k => {
          allAttacks.push({
            sq: attacked[k],
            p: this.getPiece(attacked[k][0], attacked[k][1])
          });
          this.board[attacked[k][0]][attacked[k][1]] = V.EMPTY;
        });
      }

      // Put removed pieces back on board:
      allAttacks.forEach(v => {
        this.board[v.sq[0]][v.sq[1]] = oppCol + v.p;
      });
      this.undo(m);
      allAttacks.forEach(v => {
        m.vanish.push(
          new PiPo({
            x: v.sq[0],
            y: v.sq[1],
            c: oppCol,
            p: v.p
          })
        );
      });
    });

    return moves;
  }

  // No "under check" conditions in castling
  getCastleMoves(sq) {
    return super.getCastleMoves(sq, "castleInCheck");
  }

  // TODO: allow pieces to "commit suicide"? (Currently yes except king)
  filterValid(moves) {
    // Remove moves which let the king mate-captured:
    if (moves.length == 0) return [];
    const color = this.turn;
    const oppCol = V.GetOppCol(color);
    return moves.filter(m => {
      let res = true;
      this.play(m);
      if (this.underCheck(color)) {
        res = false;
        const attacked = this.kingPos[color];
        // Try to find a move to escape check
        // TODO: very inefficient method.
        outerLoop: for (let i=0; i<V.size.x; i++) {
          for (let j=0; j<V.size.y; j++) {
            if (this.getColor(i,j) == color) {
              let emoves = [];
              // Artficial turn change to "play twice":
              this.turn = color;
              switch (this.getPiece(i, j)) {
                case V.PAWN:
                  emoves = this.getPotentialPawnMoves([i, j]);
                  break;
                case V.ROOK:
                  emoves = this.getPotentialRookMoves([i, j]);
                  break;
                case V.KNIGHT:
                  emoves = this.getPotentialKnightMoves([i, j]);
                  break;
                case V.BISHOP:
                  emoves = this.getPotentialBishopMoves([i, j]);
                  break;
                case V.QUEEN:
                  emoves = this.getPotentialQueenMoves([i, j]);
                  break;
                case V.KING:
                  emoves = this.getPotentialKingMoves([i, j]);
                  break;
              }
              this.turn = oppCol;
              for (let em of emoves) {
                V.PlayOnBoard(this.board, em);
                let sq = attacked;
                if (em.start.x == attacked[0] && em.start.y == attacked[1])
                  // King moved:
                  sq = [em.appear[0].x, em.appear[0].y];
                if (!this.isAttacked(sq, oppCol))
                  res = true;
                V.UndoOnBoard(this.board, em);
                if (res)
                  // No need to explore more moves
                  break outerLoop;
              }
            }
          }
        }
      }
      this.undo(m);
      return res;
    });
  }

  postPlay(move) {
    super.postPlay(move);
    if (move.vanish.length >= 2 && move.appear.length == 1) {
      for (let i = 1; i<move.vanish.length; i++) {
        const v = move.vanish[i];
        // Did opponent king disappeared?
        if (v.p == V.KING)
          this.kingPos[this.turn] = [-1, -1];
        // Or maybe a rook?
        else if (v.p == V.ROOK) {
          if (v.y < this.INIT_COL_KING[v.c])
            this.castleFlags[v.c][0] = 8;
          else
            // v.y > this.INIT_COL_KING[v.c]
            this.castleFlags[v.c][1] = 8;
        }
      }
    }
  }

  preUndo(move) {
    super.preUndo(move);
    const oppCol = this.turn;
    if (move.vanish.length >= 2 && move.appear.length == 1) {
      // Did opponent king disappeared?
      const psq = move.vanish.find(v => v.p == V.KING && v.c == oppCol)
      if (psq)
        this.kingPos[psq.c] = [psq.x, psq.y];
    }
  }

  getCurrentScore() {
    const color = this.turn;
    const kp = this.kingPos[color];
    if (kp[0] < 0)
      // King disappeared
      return color == "w" ? "0-1" : "1-0";
    if (this.atLeastOneMove()) return "*";
    // Kings still there, no moves:
    return "1/2";
  }

  static get SEARCH_DEPTH() {
    return 1;
  }

  getNotation(move) {
    let notation = super.getNotation(move);
    // Add a capture mark (not describing what is captured...):
    if (move.vanish.length > 1 && move.appear.length == 1) {
      if (!!(notation.match(/^[a-h]x/)))
        // Pawn capture: remove initial "b" in bxc4 for example
        notation = notation.substr(1);
      notation = notation.replace("x","") + "X";
    }
    return notation;
  }
};
Commit	Line	Data
e9b736ee BA	1	import { ChessRules, PiPo, Move } from "@/base_rules";
e9b736ee BA	2
32f6285e	3	export class Allmate1Rules extends ChessRules {
e9b736ee BA	4	static get HasEnpassant() {
	5	return false;
	6	}
	7
e9b736ee BA	8	getCheckSquares() {
	9	// No notion of check
	10	return [];
	11	}
	12
7ba4a5bc	13	static GenRandInitFen(randomness) {
3a2a7b5f	14	return ChessRules.GenRandInitFen(randomness).slice(0, -2);
e9b736ee BA	15	}
	16
	17	getPotentialMovesFrom([x, y]) {
	18	let moves = super.getPotentialMovesFrom([x, y]);
4404e58c BA	19	// Remove standard captures (without removing castling):
	20	moves = moves.filter(m => {
	21	return m.vanish.length == 1 \|\| m.appear.length == 2;
	22	});
e9b736ee BA	23
	24	// Augment moves with "mate-captures":
	25	// TODO: this is coded in a highly inefficient way...
	26	const color = this.turn;
	27	const oppCol = V.GetOppCol(this.turn);
	28	moves.forEach(m => {
	29	this.play(m);
0eebb0df	30	let allAttacks = [];
e9b736ee	31
0eebb0df BA	32	// While something has been captured:
	33	// remove it, and keep looking for captures
	34	outerLoop: while (true) {
	35
	36	// 1) What is attacked?
	37	let attacked = {};
	38	for (let i=0; i<V.size.x; i++) {
	39	for (let j=0; j<V.size.y; j++) {
	40	if (this.getColor(i,j) == oppCol && this.isAttacked([i,j], color))
	41	attacked[i+"_"+j] = [i,j];
	42	}
e9b736ee	43	}
0eebb0df	44	if (Object.keys(attacked).length == 0) break outerLoop;
e9b736ee	45
0eebb0df BA	46	// 2) Among attacked pieces, which cannot escape capture?
	47	// Avoid "oppMoves = this.getAllValidMoves();" => infinite recursion
	48	for (let i=0; i<V.size.x; i++) {
	49	for (let j=0; j<V.size.y; j++) {
	50	if (this.getColor(i,j) == oppCol) {
	51	let oppMoves = [];
	52	switch (this.getPiece(i, j)) {
	53	case V.PAWN:
	54	oppMoves = this.getPotentialPawnMoves([i, j]);
	55	break;
	56	case V.ROOK:
	57	oppMoves = this.getPotentialRookMoves([i, j]);
	58	break;
	59	case V.KNIGHT:
	60	oppMoves = this.getPotentialKnightMoves([i, j]);
	61	break;
	62	case V.BISHOP:
	63	oppMoves = this.getPotentialBishopMoves([i, j]);
	64	break;
	65	case V.QUEEN:
	66	oppMoves = this.getPotentialQueenMoves([i, j]);
	67	break;
	68	case V.KING:
	69	// Do not allow castling to escape from check
	70	oppMoves = super.getSlideNJumpMoves(
	71	[i, j],
	72	V.steps[V.ROOK].concat(V.steps[V.BISHOP]),
	73	"oneStep"
	74	);
	75	break;
	76	}
	77	for (let om of oppMoves) {
	78	V.PlayOnBoard(this.board, om);
	79	Object.values(attacked).forEach(sq => {
	80	const origSq = [sq[0], sq[1]];
	81	if (om.start.x == sq[0] && om.start.y == sq[1])
	82	// Piece moved:
	83	sq = [om.appear[0].x, om.appear[0].y];
	84	if (!this.isAttacked(sq, color))
	85	delete attacked[origSq[0]+"_"+origSq[1]];
	86	});
	87	V.UndoOnBoard(this.board, om);
	88	if (Object.keys(attacked).length == 0)
	89	// No need to explore more moves
	90	break outerLoop;
	91	}
e9b736ee BA	92	}
	93	}
	94	}
0eebb0df BA	95
	96	// 3) Add mate-captures and remove pieces from board:
	97	Object.keys(attacked).forEach(k => {
	98	allAttacks.push({
	99	sq: attacked[k],
	100	p: this.getPiece(attacked[k][0], attacked[k][1])
	101	});
	102	this.board[attacked[k][0]][attacked[k][1]] = V.EMPTY;
	103	});
e9b736ee BA	104	}
e9b736ee BA	105
0eebb0df BA	106	// Put removed pieces back on board:
	107	allAttacks.forEach(v => {
	108	this.board[v.sq[0]][v.sq[1]] = oppCol + v.p;
e9b736ee	109	});
e9b736ee	110	this.undo(m);
0eebb0df BA	111	allAttacks.forEach(v => {
	112	m.vanish.push(
	113	new PiPo({
	114	x: v.sq[0],
	115	y: v.sq[1],
	116	c: oppCol,
	117	p: v.p
	118	})
	119	);
	120	});
e9b736ee BA	121	});
	122
	123	return moves;
	124	}
	125
	126	// No "under check" conditions in castling
a6836242 BA	127	getCastleMoves(sq) {
a6836242 BA	128	return super.getCastleMoves(sq, "castleInCheck");
e9b736ee BA	129	}
e9b736ee BA	130
54b7b81b	131	// TODO: allow pieces to "commit suicide"? (Currently yes except king)
e9b736ee	132	filterValid(moves) {
54b7b81b BA	133	// Remove moves which let the king mate-captured:
	134	if (moves.length == 0) return [];
	135	const color = this.turn;
	136	const oppCol = V.GetOppCol(color);
	137	return moves.filter(m => {
	138	let res = true;
	139	this.play(m);
	140	if (this.underCheck(color)) {
	141	res = false;
	142	const attacked = this.kingPos[color];
	143	// Try to find a move to escape check
	144	// TODO: very inefficient method.
	145	outerLoop: for (let i=0; i<V.size.x; i++) {
	146	for (let j=0; j<V.size.y; j++) {
	147	if (this.getColor(i,j) == color) {
	148	let emoves = [];
	149	// Artficial turn change to "play twice":
	150	this.turn = color;
	151	switch (this.getPiece(i, j)) {
	152	case V.PAWN:
	153	emoves = this.getPotentialPawnMoves([i, j]);
	154	break;
	155	case V.ROOK:
	156	emoves = this.getPotentialRookMoves([i, j]);
	157	break;
	158	case V.KNIGHT:
	159	emoves = this.getPotentialKnightMoves([i, j]);
	160	break;
	161	case V.BISHOP:
	162	emoves = this.getPotentialBishopMoves([i, j]);
	163	break;
	164	case V.QUEEN:
	165	emoves = this.getPotentialQueenMoves([i, j]);
	166	break;
	167	case V.KING:
	168	emoves = this.getPotentialKingMoves([i, j]);
	169	break;
	170	}
	171	this.turn = oppCol;
	172	for (let em of emoves) {
	173	V.PlayOnBoard(this.board, em);
	174	let sq = attacked;
	175	if (em.start.x == attacked[0] && em.start.y == attacked[1])
	176	// King moved:
	177	sq = [em.appear[0].x, em.appear[0].y];
32f6285e	178	if (!this.isAttacked(sq, oppCol))
54b7b81b BA	179	res = true;
	180	V.UndoOnBoard(this.board, em);
	181	if (res)
	182	// No need to explore more moves
	183	break outerLoop;
	184	}
	185	}
	186	}
	187	}
	188	}
	189	this.undo(m);
	190	return res;
	191	});
e9b736ee BA	192	}
e9b736ee BA	193
3a2a7b5f BA	194	postPlay(move) {
3a2a7b5f BA	195	super.postPlay(move);
094e11f2	196	if (move.vanish.length >= 2 && move.appear.length == 1) {
3a2a7b5f BA	197	for (let i = 1; i<move.vanish.length; i++) {
3a2a7b5f BA	198	const v = move.vanish[i];
094e11f2 BA	199	// Did opponent king disappeared?
	200	if (v.p == V.KING)
	201	this.kingPos[this.turn] = [-1, -1];
	202	// Or maybe a rook?
	203	else if (v.p == V.ROOK) {
	204	if (v.y < this.INIT_COL_KING[v.c])
3a2a7b5f	205	this.castleFlags[v.c][0] = 8;
094e11f2 BA	206	else
094e11f2 BA	207	// v.y > this.INIT_COL_KING[v.c]
3a2a7b5f	208	this.castleFlags[v.c][1] = 8;
094e11f2	209	}
3a2a7b5f	210	}
e9b736ee BA	211	}
	212	}
	213
3a2a7b5f BA	214	preUndo(move) {
	215	super.preUndo(move);
	216	const oppCol = this.turn;
094e11f2	217	if (move.vanish.length >= 2 && move.appear.length == 1) {
e9b736ee	218	// Did opponent king disappeared?
3a2a7b5f	219	const psq = move.vanish.find(v => v.p == V.KING && v.c == oppCol)
094e11f2 BA	220	if (psq)
094e11f2 BA	221	this.kingPos[psq.c] = [psq.x, psq.y];
e9b736ee BA	222	}
	223	}
	224
	225	getCurrentScore() {
	226	const color = this.turn;
	227	const kp = this.kingPos[color];
	228	if (kp[0] < 0)
	229	// King disappeared
	230	return color == "w" ? "0-1" : "1-0";
bb688df5	231	if (this.atLeastOneMove()) return "*";
e9b736ee BA	232	// Kings still there, no moves:
	233	return "1/2";
	234	}
	235
	236	static get SEARCH_DEPTH() {
b83a675a	237	return 1;
e9b736ee BA	238	}
	239
	240	getNotation(move) {
	241	let notation = super.getNotation(move);
	242	// Add a capture mark (not describing what is captured...):
23ecf008	243	if (move.vanish.length > 1 && move.appear.length == 1) {
188b4a8f	244	if (!!(notation.match(/^[a-h]x/)))
23ecf008 BA	245	// Pawn capture: remove initial "b" in bxc4 for example
	246	notation = notation.substr(1);
	247	notation = notation.replace("x","") + "X";
54b7b81b	248	}
e9b736ee BA	249	return notation;
	250	}
	251	};