[vchess.git] / public / javascripts / variants / Grand.js

// NOTE: initial setup differs from the original; see
// https://www.chessvariants.com/large.dir/freeling.html
class GrandRules extends ChessRules
{
	static getPpath(b)
	{
		const V = VariantRules;
		return ([V.MARSHALL,V.CARDINAL].includes(b[1]) ? "Grand/" : "") + b;
	}

	initVariables(fen)
	{
		super.initVariables(fen);
		this.captures = { "w": {}, "b": {} }; //for promotions
	}

	static get size() { return [10,10]; }

	static get MARSHALL() { return 'm'; } //rook+knight
	static get CARDINAL() { return 'c'; } //bishop+knight

	// En-passant after 2-sq or 3-sq jumps
	getEpSquare(move)
	{
		const [sx,sy,ex] = [move.start.x,move.start.y,move.end.x];
		if (this.getPiece(sx,sy) == VariantRules.PAWN && Math.abs(sx - ex) >= 2)
		{
			const step = (ex-sx) / Math.abs(ex-sx);
			let res = [{
				x: sx + step,
				y: sy
			}];
			if (sx + 2*step != ex) //3-squares move
			{
				res.push({
					x: sx + 2*step,
					y: sy
				});
			}
			return res;
		}
		return undefined; //default
	}

	getPotentialMovesFrom([x,y])
	{
		switch (this.getPiece(x,y))
		{
			case VariantRules.MARSHALL:
				return this.getPotentialMarshallMoves([x,y]);
			case VariantRules.CARDINAL:
				return this.getPotentialCardinalMoves([x,y]);
			default:
				return super.getPotentialMovesFrom([x,y])
		}
	}

	// Special pawn rules: promotions to captured friendly pieces,
	// optional on ranks 8-9 and mandatory on rank 10.
	getPotentialPawnMoves([x,y])
	{
		const color = this.turn;
		let moves = [];
		const V = VariantRules;
		const [sizeX,sizeY] = VariantRules.size;
		const shift = (color == "w" ? -1 : 1);
		const startRanks = (color == "w" ? [sizeX-2,sizeX-3] : [1,2]);
		const lastRanks = (color == "w" ? [0,1,2] : [sizeX-1,sizeX-2,sizeX-3]);

		if (x+shift >= 0 && x+shift < sizeX && x+shift != lastRanks[0])
		{
			// Normal moves
			if (this.board[x+shift][y] == V.EMPTY)
			{
				moves.push(this.getBasicMove([x,y], [x+shift,y]));
				if (startRanks.includes(x) && this.board[x+2*shift][y] == V.EMPTY)
				{
					// Two squares jump
					moves.push(this.getBasicMove([x,y], [x+2*shift,y]));
					if (x == startRanks[0] && this.board[x+3*shift][y] == V.EMPTY)
					{
						// 3-squares jump
						moves.push(this.getBasicMove([x,y], [x+3*shift,y]));
					}
				}
			}
			// Captures
			if (y>0 && this.canTake([x,y], [x+shift,y-1])
				&& this.board[x+shift][y-1] != V.EMPTY)
			{
				moves.push(this.getBasicMove([x,y], [x+shift,y-1]));
			}
			if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
				&& this.board[x+shift][y+1] != V.EMPTY)
			{
				moves.push(this.getBasicMove([x,y], [x+shift,y+1]));
			}
		}

		if (lastRanks.includes(x+shift))
		{
			// Promotion
			let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN,V.MARSHALL,V.CARDINAL];
			promotionPieces.forEach(p => {
				if (!this.captures[color][p] || this.captures[color][p]==0)
					return;
				// Normal move
				if (this.board[x+shift][y] == V.EMPTY)
					moves.push(this.getBasicMove([x,y], [x+shift,y], {c:color,p:p}));
				// Captures
				if (y>0 && this.canTake([x,y], [x+shift,y-1])
					&& this.board[x+shift][y-1] != V.EMPTY)
				{
					moves.push(this.getBasicMove([x,y], [x+shift,y-1], {c:color,p:p}));
				}
				if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
					&& this.board[x+shift][y+1] != V.EMPTY)
				{
					moves.push(this.getBasicMove([x,y], [x+shift,y+1], {c:color,p:p}));
				}
			});
		}

		// En passant
		const Lep = this.epSquares.length;
		const epSquare = Lep>0 ? this.epSquares[Lep-1] : undefined;
		if (!!epSquare)
		{
			for (let epsq of epSquare)
			{
				// TODO: some redundant checks
				if (epsq.x == x+shift && Math.abs(epsq.y - y) == 1)
				{
					let epStep = epsq.y - y;
					var enpassantMove = this.getBasicMove([x,y], [x+shift,y+epStep]);
					enpassantMove.vanish.push({
						x: x,
						y: y+epStep,
						p: 'p',
						c: this.getColor(x,y+epStep)
					});
					moves.push(enpassantMove);
				}
			}
		}

		return moves;
	}

	// TODO: different castle?

	getPotentialMarshallMoves(sq)
	{
		const V = VariantRules;
		return this.getSlideNJumpMoves(sq, V.steps[V.ROOK]).concat(
			this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
	}

	getPotentialCardinalMoves(sq)
	{
		const V = VariantRules;
		return this.getSlideNJumpMoves(sq, V.steps[V.BISHOP]).concat(
			this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
	}

	isAttacked(sq, colors)
	{
		return super.isAttacked(sq, colors)
			|| this.isAttackedByMarshall(sq, colors)
			|| this.isAttackedByCardinal(sq, colors);
	}

	isAttackedByMarshall(sq, colors)
	{
		const V = VariantRules;
		return this.isAttackedBySlideNJump(sq, colors, V.MARSHALL, V.steps[V.ROOK])
			|| this.isAttackedBySlideNJump(
				sq, colors, V.MARSHALL, V.steps[V.KNIGHT], "oneStep");
	}

	isAttackedByCardinal(sq, colors)
	{
		const V = VariantRules;
		return this.isAttackedBySlideNJump(sq, colors, V.CARDINAL, V.steps[V.BISHOP])
			|| this.isAttackedBySlideNJump(
				sq, colors, V.CARDINAL, V.steps[V.KNIGHT], "oneStep");
	}

	updateVariables(move)
	{
		super.updateVariables(move);
		if (move.vanish.length==2 && move.appear.length==1
			&& move.vanish[1].p != VariantRules.PAWN)
		{
			// Capture: update this.captures
			if (!this.captures[move.vanish[1].c][move.vanish[1].p])
				this.captures[move.vanish[1].c][move.vanish[1].p] = 1;
			else
				this.captures[move.vanish[1].c][move.vanish[1].p]++;
		}
	}

	unupdateVariables(move)
	{
		super.unupdateVariables(move);
		if (move.vanish.length==2 && move.appear.length==1
			&& move.vanish[1].p != VariantRules.PAWN)
		{
			this.captures[move.vanish[1].c][move.vanish[1].p] =
				Math.max(0, this.captures[move.vanish[1].c][move.vanish[1].p]-1);
		}
	}

	static get VALUES() {
		return Object.assign(
			ChessRules.VALUES,
			{'c': 5, 'm': 7} //experimental
		);
	}

	static get SEARCH_DEPTH() { return 2; }

	// TODO: this function could be generalized and shared better
	static GenRandInitFen()
	{
		let pieces = { "w": new Array(10), "b": new Array(10) };
		// Shuffle pieces on first and last rank
		for (let c of ["w","b"])
		{
			let positions = _.range(10);

			// Get random squares for bishops
			let randIndex = 2 * _.random(4);
			let bishop1Pos = positions[randIndex];
			// The second bishop must be on a square of different color
			let randIndex_tmp = 2 * _.random(4) + 1;
			let bishop2Pos = positions[randIndex_tmp];
			// Remove chosen squares
			positions.splice(Math.max(randIndex,randIndex_tmp), 1);
			positions.splice(Math.min(randIndex,randIndex_tmp), 1);

			// Get random squares for knights
			randIndex = _.random(7);
			let knight1Pos = positions[randIndex];
			positions.splice(randIndex, 1);
			randIndex = _.random(6);
			let knight2Pos = positions[randIndex];
			positions.splice(randIndex, 1);

			// Get random square for queen
			randIndex = _.random(5);
			let queenPos = positions[randIndex];
			positions.splice(randIndex, 1);

			// ...random square for marshall
			randIndex = _.random(4);
			let marshallPos = positions[randIndex];
			positions.splice(randIndex, 1);

			// ...random square for cardinal
			randIndex = _.random(3);
			let cardinalPos = positions[randIndex];
			positions.splice(randIndex, 1);

			// Rooks and king positions are now fixed, because of the ordering rook-king-rook
			let rook1Pos = positions[0];
			let kingPos = positions[1];
			let rook2Pos = positions[2];

			// Finally put the shuffled pieces in the board array
			pieces[c][rook1Pos] = 'r';
			pieces[c][knight1Pos] = 'n';
			pieces[c][bishop1Pos] = 'b';
			pieces[c][queenPos] = 'q';
			pieces[c][marshallPos] = 'm';
			pieces[c][cardinalPos] = 'c';
			pieces[c][kingPos] = 'k';
			pieces[c][bishop2Pos] = 'b';
			pieces[c][knight2Pos] = 'n';
			pieces[c][rook2Pos] = 'r';
		}
		let fen = pieces["b"].join("") +
			"/pppppppppp/10/10/10/10/10/10/PPPPPPPPPP/" +
			pieces["w"].join("").toUpperCase() +
			" 1111";
		return fen;
	}
}
Commit	Line	Data
92342261 BA	1	// NOTE: initial setup differs from the original; see
92342261 BA	2	// https://www.chessvariants.com/large.dir/freeling.html
a37076f1 BA	3	class GrandRules extends ChessRules
	4	{
	5	static getPpath(b)
	6	{
	7	const V = VariantRules;
c6052161	8	return ([V.MARSHALL,V.CARDINAL].includes(b[1]) ? "Grand/" : "") + b;
a37076f1 BA	9	}
a37076f1 BA	10
c6052161 BA	11	initVariables(fen)
	12	{
	13	super.initVariables(fen);
	14	this.captures = { "w": {}, "b": {} }; //for promotions
	15	}
	16
	17	static get size() { return [10,10]; }
	18
a37076f1 BA	19	static get MARSHALL() { return 'm'; } //rook+knight
	20	static get CARDINAL() { return 'c'; } //bishop+knight
	21
c6052161	22	// En-passant after 2-sq or 3-sq jumps
a37076f1 BA	23	getEpSquare(move)
	24	{
	25	const [sx,sy,ex] = [move.start.x,move.start.y,move.end.x];
c6052161	26	if (this.getPiece(sx,sy) == VariantRules.PAWN && Math.abs(sx - ex) >= 2)
a37076f1	27	{
c6052161 BA	28	const step = (ex-sx) / Math.abs(ex-sx);
	29	let res = [{
	30	x: sx + step,
a37076f1	31	y: sy
c6052161 BA	32	}];
	33	if (sx + 2*step != ex) //3-squares move
	34	{
	35	res.push({
	36	x: sx + 2*step,
	37	y: sy
	38	});
	39	}
	40	return res;
a37076f1 BA	41	}
	42	return undefined; //default
	43	}
	44
	45	getPotentialMovesFrom([x,y])
	46	{
	47	switch (this.getPiece(x,y))
	48	{
	49	case VariantRules.MARSHALL:
	50	return this.getPotentialMarshallMoves([x,y]);
	51	case VariantRules.CARDINAL:
	52	return this.getPotentialCardinalMoves([x,y]);
	53	default:
	54	return super.getPotentialMovesFrom([x,y])
	55	}
	56	}
	57
c6052161 BA	58	// Special pawn rules: promotions to captured friendly pieces,
c6052161 BA	59	// optional on ranks 8-9 and mandatory on rank 10.
a37076f1 BA	60	getPotentialPawnMoves([x,y])
a37076f1 BA	61	{
c6052161 BA	62	const color = this.turn;
	63	let moves = [];
	64	const V = VariantRules;
	65	const [sizeX,sizeY] = VariantRules.size;
	66	const shift = (color == "w" ? -1 : 1);
cf130369 BA	67	const startRanks = (color == "w" ? [sizeX-2,sizeX-3] : [1,2]);
cf130369 BA	68	const lastRanks = (color == "w" ? [0,1,2] : [sizeX-1,sizeX-2,sizeX-3]);
c6052161 BA	69
	70	if (x+shift >= 0 && x+shift < sizeX && x+shift != lastRanks[0])
	71	{
	72	// Normal moves
	73	if (this.board[x+shift][y] == V.EMPTY)
	74	{
	75	moves.push(this.getBasicMove([x,y], [x+shift,y]));
	76	if (startRanks.includes(x) && this.board[x+2*shift][y] == V.EMPTY)
	77	{
	78	// Two squares jump
	79	moves.push(this.getBasicMove([x,y], [x+2*shift,y]));
8a196305	80	if (x == startRanks[0] && this.board[x+3*shift][y] == V.EMPTY)
c6052161 BA	81	{
	82	// 3-squares jump
	83	moves.push(this.getBasicMove([x,y], [x+3*shift,y]));
	84	}
	85	}
	86	}
	87	// Captures
92342261 BA	88	if (y>0 && this.canTake([x,y], [x+shift,y-1])
	89	&& this.board[x+shift][y-1] != V.EMPTY)
	90	{
c6052161	91	moves.push(this.getBasicMove([x,y], [x+shift,y-1]));
92342261 BA	92	}
	93	if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
	94	&& this.board[x+shift][y+1] != V.EMPTY)
	95	{
c6052161	96	moves.push(this.getBasicMove([x,y], [x+shift,y+1]));
92342261	97	}
c6052161 BA	98	}
	99
	100	if (lastRanks.includes(x+shift))
	101	{
	102	// Promotion
8a196305	103	let promotionPieces = [V.ROOK,V.KNIGHT,V.BISHOP,V.QUEEN,V.MARSHALL,V.CARDINAL];
c6052161 BA	104	promotionPieces.forEach(p => {
	105	if (!this.captures[color][p] \|\| this.captures[color][p]==0)
	106	return;
	107	// Normal move
	108	if (this.board[x+shift][y] == V.EMPTY)
	109	moves.push(this.getBasicMove([x,y], [x+shift,y], {c:color,p:p}));
	110	// Captures
92342261 BA	111	if (y>0 && this.canTake([x,y], [x+shift,y-1])
	112	&& this.board[x+shift][y-1] != V.EMPTY)
	113	{
c6052161	114	moves.push(this.getBasicMove([x,y], [x+shift,y-1], {c:color,p:p}));
92342261 BA	115	}
	116	if (y<sizeY-1 && this.canTake([x,y], [x+shift,y+1])
	117	&& this.board[x+shift][y+1] != V.EMPTY)
	118	{
c6052161	119	moves.push(this.getBasicMove([x,y], [x+shift,y+1], {c:color,p:p}));
92342261	120	}
c6052161 BA	121	});
	122	}
	123
	124	// En passant
	125	const Lep = this.epSquares.length;
	126	const epSquare = Lep>0 ? this.epSquares[Lep-1] : undefined;
	127	if (!!epSquare)
	128	{
	129	for (let epsq of epSquare)
	130	{
	131	// TODO: some redundant checks
	132	if (epsq.x == x+shift && Math.abs(epsq.y - y) == 1)
	133	{
	134	let epStep = epsq.y - y;
	135	var enpassantMove = this.getBasicMove([x,y], [x+shift,y+epStep]);
	136	enpassantMove.vanish.push({
	137	x: x,
	138	y: y+epStep,
	139	p: 'p',
	140	c: this.getColor(x,y+epStep)
	141	});
	142	moves.push(enpassantMove);
	143	}
	144	}
	145	}
	146
	147	return moves;
a37076f1 BA	148	}
a37076f1 BA	149
8a196305 BA	150	// TODO: different castle?
8a196305 BA	151
a37076f1 BA	152	getPotentialMarshallMoves(sq)
	153	{
	154	const V = VariantRules;
	155	return this.getSlideNJumpMoves(sq, V.steps[V.ROOK]).concat(
	156	this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
	157	}
	158
	159	getPotentialCardinalMoves(sq)
	160	{
	161	const V = VariantRules;
	162	return this.getSlideNJumpMoves(sq, V.steps[V.BISHOP]).concat(
	163	this.getSlideNJumpMoves(sq, V.steps[V.KNIGHT], "oneStep"));
	164	}
	165
	166	isAttacked(sq, colors)
	167	{
c6052161	168	return super.isAttacked(sq, colors)
a37076f1 BA	169	\|\| this.isAttackedByMarshall(sq, colors)
	170	\|\| this.isAttackedByCardinal(sq, colors);
	171	}
	172
	173	isAttackedByMarshall(sq, colors)
	174	{
	175	const V = VariantRules;
	176	return this.isAttackedBySlideNJump(sq, colors, V.MARSHALL, V.steps[V.ROOK])
92342261 BA	177	\|\| this.isAttackedBySlideNJump(
92342261 BA	178	sq, colors, V.MARSHALL, V.steps[V.KNIGHT], "oneStep");
a37076f1 BA	179	}
	180
	181	isAttackedByCardinal(sq, colors)
	182	{
	183	const V = VariantRules;
	184	return this.isAttackedBySlideNJump(sq, colors, V.CARDINAL, V.steps[V.BISHOP])
92342261 BA	185	\|\| this.isAttackedBySlideNJump(
92342261 BA	186	sq, colors, V.CARDINAL, V.steps[V.KNIGHT], "oneStep");
a37076f1 BA	187	}
a37076f1 BA	188
a6abf094	189	updateVariables(move)
c6052161	190	{
a6abf094	191	super.updateVariables(move);
c6052161 BA	192	if (move.vanish.length==2 && move.appear.length==1
	193	&& move.vanish[1].p != VariantRules.PAWN)
	194	{
	195	// Capture: update this.captures
	196	if (!this.captures[move.vanish[1].c][move.vanish[1].p])
	197	this.captures[move.vanish[1].c][move.vanish[1].p] = 1;
	198	else
	199	this.captures[move.vanish[1].c][move.vanish[1].p]++;
	200	}
	201	}
	202
a6abf094	203	unupdateVariables(move)
c6052161	204	{
a6abf094	205	super.unupdateVariables(move);
c6052161 BA	206	if (move.vanish.length==2 && move.appear.length==1
	207	&& move.vanish[1].p != VariantRules.PAWN)
	208	{
c6052161 BA	209	this.captures[move.vanish[1].c][move.vanish[1].p] =
	210	Math.max(0, this.captures[move.vanish[1].c][move.vanish[1].p]-1);
	211	}
	212	}
	213
a37076f1 BA	214	static get VALUES() {
	215	return Object.assign(
	216	ChessRules.VALUES,
	217	{'c': 5, 'm': 7} //experimental
	218	);
	219	}
	220
3c09dc49 BA	221	static get SEARCH_DEPTH() { return 2; }
3c09dc49 BA	222
c6052161	223	// TODO: this function could be generalized and shared better
a37076f1 BA	224	static GenRandInitFen()
a37076f1 BA	225	{
92342261	226	let pieces = { "w": new Array(10), "b": new Array(10) };
c6052161	227	// Shuffle pieces on first and last rank
92342261	228	for (let c of ["w","b"])
c6052161 BA	229	{
	230	let positions = _.range(10);
	231
	232	// Get random squares for bishops
	233	let randIndex = 2 * _.random(4);
	234	let bishop1Pos = positions[randIndex];
	235	// The second bishop must be on a square of different color
	236	let randIndex_tmp = 2 * _.random(4) + 1;
	237	let bishop2Pos = positions[randIndex_tmp];
	238	// Remove chosen squares
	239	positions.splice(Math.max(randIndex,randIndex_tmp), 1);
	240	positions.splice(Math.min(randIndex,randIndex_tmp), 1);
	241
	242	// Get random squares for knights
	243	randIndex = _.random(7);
	244	let knight1Pos = positions[randIndex];
	245	positions.splice(randIndex, 1);
	246	randIndex = _.random(6);
	247	let knight2Pos = positions[randIndex];
	248	positions.splice(randIndex, 1);
	249
	250	// Get random square for queen
	251	randIndex = _.random(5);
	252	let queenPos = positions[randIndex];
	253	positions.splice(randIndex, 1);
	254
	255	// ...random square for marshall
	256	randIndex = _.random(4);
	257	let marshallPos = positions[randIndex];
	258	positions.splice(randIndex, 1);
	259
	260	// ...random square for cardinal
	261	randIndex = _.random(3);
	262	let cardinalPos = positions[randIndex];
	263	positions.splice(randIndex, 1);
	264
	265	// Rooks and king positions are now fixed, because of the ordering rook-king-rook
	266	let rook1Pos = positions[0];
	267	let kingPos = positions[1];
	268	let rook2Pos = positions[2];
	269
	270	// Finally put the shuffled pieces in the board array
	271	pieces[c][rook1Pos] = 'r';
	272	pieces[c][knight1Pos] = 'n';
	273	pieces[c][bishop1Pos] = 'b';
	274	pieces[c][queenPos] = 'q';
	275	pieces[c][marshallPos] = 'm';
	276	pieces[c][cardinalPos] = 'c';
	277	pieces[c][kingPos] = 'k';
	278	pieces[c][bishop2Pos] = 'b';
	279	pieces[c][knight2Pos] = 'n';
	280	pieces[c][rook2Pos] = 'r';
	281	}
92342261	282	let fen = pieces["b"].join("") +
c6052161	283	"/pppppppppp/10/10/10/10/10/10/PPPPPPPPPP/" +
92342261	284	pieces["w"].join("").toUpperCase() +
c6052161 BA	285	" 1111";
c6052161 BA	286	return fen;
a37076f1 BA	287	}
a37076f1 BA	288	}