X-Git-Url: https://git.auder.net/css/rpsls.css?a=blobdiff_plain;f=public%2Fjavascripts%2Fvariants%2FAlice.js;h=dd023bba42afc029a58d500e37637bd9f75fecb3;hb=06ddfe34f6ef5c82d206332245ed4f33a9d92715;hp=db0881e29b863fae99d0b7215fcf0a95b7a27e62;hpb=0cd8f2bdfe04a0bd880ee48ef2dcce24728536ee;p=vchess.git

diff --git a/public/javascripts/variants/Alice.js b/public/javascripts/variants/Alice.js
index db0881e2..dd023bba 100644
--- a/public/javascripts/variants/Alice.js
+++ b/public/javascripts/variants/Alice.js
@@ -1,86 +1,265 @@
-class AliceRules extends ChessRUles
+class AliceRules extends ChessRules
 {
-	// TODO: more general double correspondance normal <--> alice
 	static get ALICE_PIECES()
 	{
-		return ['s','t','u','c','o','l']; //king is 'l'
+		return {
+			's': 'p',
+			't': 'q',
+			'u': 'r',
+			'c': 'b',
+			'o': 'n',
+			'l': 'k',
+		};
+	}
+	static get ALICE_CODES()
+	{
+		return {
+			'p': 's',
+			'q': 't',
+			'r': 'u',
+			'b': 'c',
+			'n': 'o',
+			'k': 'l',
+		};
 	}
 
 	static getPpath(b)
 	{
-		return (this.ALICE_PIECES.includes(b[1]) ? "Alice/" : "") + b;
+		return (Object.keys(this.ALICE_PIECES).includes(b[1]) ? "Alice/" : "") + b;
 	}
 
-	getPotentialMovesFrom([x,y])
+	initVariables(fen)
 	{
-		// Build board1+board2 from complete board
-		let board1 = doubleArray(sizeX, sizeY, "");
-		let board2 = doubleArray(sizeX, sizeY, "");
-		const [sizeX,sizeY] = variantRules.size;
+		super.initVariables(fen);
+		const fenParts = fen.split(" ");
+		const position = fenParts[0].split("/");
+		if (this.kingPos["w"][0] < 0 || this.kingPos["b"][0] < 0)
+		{
+			// INIT_COL_XXX won't be used, so no need to set them for Alice kings
+			for (let i=0; i<position.length; i++)
+			{
+				let k = 0; //column index on board
+				for (let j=0; j<position[i].length; j++)
+				{
+					switch (position[i].charAt(j))
+					{
+						case 'l':
+							this.kingPos['b'] = [i,k];
+							break;
+						case 'L':
+							this.kingPos['w'] = [i,k];
+							break;
+						default:
+							let num = parseInt(position[i].charAt(j));
+							if (!isNaN(num))
+								k += (num-1);
+					}
+					k++;
+				}
+			}
+		}
+	}
+
+	getBoardOfPiece([x,y])
+	{
+		const V = VariantRules;
+		// Build board where the piece is
+		const mirrorSide = (Object.keys(V.ALICE_CODES).includes(this.getPiece(x,y)) ? 1 : 2);
+		// Build corresponding board from complete board
+		const [sizeX,sizeY] = V.size;
+		let sideBoard = doubleArray(sizeX, sizeY, "");
 		for (let i=0; i<sizeX; i++)
 		{
 			for (let j=0; j<sizeY; j++)
 			{
 				const piece = this.getPiece(i,j);
-				if (this.ALICE_PIECES.includes(piece))
-					board2[i][j] = this.board[i][j];
-				else
-					board1[i][j] = this.board[i][j];
+				if (mirrorSide==1 && Object.keys(V.ALICE_CODES).includes(piece))
+					sideBoard[i][j] = this.board[i][j];
+				else if (mirrorSide==2 && Object.keys(V.ALICE_PIECES).includes(piece))
+					sideBoard[i][j] = this.getColor(i,j) + V.ALICE_PIECES[piece];
 			}
 		}
-		let saveBoard = JSON.parse(JSON.stringify(this.board));
-
-		// Search valid moves on both boards
-		let moves = [];
-		this.board = board1;
-
+		return sideBoard;
+	}
 
-		this.board = board2;
+	// TODO: move board building one level up (findAllMoves()) to avoid re-building at every piece...
+	// NOTE: castle & enPassant https://www.chessvariants.com/other.dir/alice.html
+	// --> Should be OK as is.
+	getPotentialMovesFrom([x,y])
+	{
+		let sideBoard = this.getBoardOfPiece([x,y]);
 
+		// Search valid moves on sideBoard
+		let saveBoard = this.board;
+		this.board = sideBoard;
+		let moves = super.getPotentialMovesFrom([x,y]);
 		this.board = saveBoard;
 
-		// Finally filter impossible moves
+		const pieces = Object.keys(VariantRules.ALICE_CODES);
+		const codes = Object.keys(VariantRules.ALICE_PIECES);
 
-		return moves;
+		// Finally filter impossible moves
+		const mirrorSide = (pieces.includes(this.getPiece(x,y)) ? 1 : 2);
+		return moves.filter(m => {
+			if (m.appear.length == 2) //castle
+			{
+				// If appear[i] not in vanish array, then must be empty square on other board
+				m.appear.forEach(psq => {
+					if (this.board[psq.x][psq.y] != VariantRules.EMPTY &&
+						![m.vanish[0].y,m.vanish[1].y].includes(psq.y))
+					{
+						return false;
+					}
+				});
+			}
+			else if (this.board[m.end.x][m.end.y] != VariantRules.EMPTY)
+			{
+				// Attempt to capture
+				const piece = this.getPiece(m.end.x,m.end.y);
+				if ((mirrorSide==1 && codes.includes(piece))
+					|| (mirrorSide==2 && pieces.includes(piece)))
+				{
+					return false;
+				}
+			}
+			// If the move is computed on board1, m.appear change for Alice pieces.
+			if (mirrorSide==1)
+			{
+				m.appear.forEach(psq => { //forEach: castling taken into account
+					psq.p = VariantRules.ALICE_CODES[psq.p]; //goto board2
+				});
+			}
+			else //move on board2: mark vanishing pieces as Alice
+			{
+				m.vanish.forEach(psq => {
+					psq.p = VariantRules.ALICE_CODES[psq.p];
+				});
+			}
+			// Fix en-passant captures
+			if (m.vanish.length == 2 && this.board[m.end.x][m.end.y] == VariantRules.EMPTY)
+			{
+				m.vanish[1].c = this.getOppCol(this.getColor(x,y));
+				// In the special case of en-passant, if
+				//  - board1 takes board2 : vanish[1] --> Alice
+				//  - board2 takes board1 : vanish[1] --> normal
+				let van = m.vanish[1];
+				if (mirrorSide==1 && codes.includes(this.getPiece(van.x,van.y)))
+					van.p = VariantRules.ALICE_CODES[van.p];
+				else if (mirrorSide==2 && pieces.includes(this.getPiece(van.x,van.y)))
+					van.p = VariantRules.ALICE_PIECES[van.p];
+			}
+			return true;
+		});
 	}
 
 	underCheck(move)
 	{
-		// 1 where is king ? if board1 then build it, if board2 then build it. then check.
 		const color = this.turn;
 		this.play(move);
+		let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
+		let saveBoard = this.board;
+		this.board = sideBoard;
 		let res = this.isAttacked(this.kingPos[color], this.getOppCol(color));
+		this.board = saveBoard;
 		this.undo(move);
 		return res;
 	}
 
-	// TODO also:
-	//getCheckSquares(move)
+	getCheckSquares(move)
+	{
+		this.play(move);
+		const color = this.turn; //opponent
+		let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
+		let saveBoard = this.board;
+		this.board = sideBoard;
+		let res = this.isAttacked(this.kingPos[color], this.getOppCol(color))
+			? [ JSON.parse(JSON.stringify(this.kingPos[color])) ]
+			: [ ];
+		this.board = saveBoard;
+		this.undo(move);
+		return res;
+	}
 
-	// TODO: pieces change side!
-	static PlayOnBoard(board, move)
+	updateVariables(move)
 	{
-		for (let psq of move.vanish)
-			board[psq.x][psq.y] = VariantRules.EMPTY;
-		for (let psq of move.appear)
-			board[psq.x][psq.y] = psq.c + psq.p;
+		super.updateVariables(move); //standard king
+		const piece = this.getPiece(move.start.x,move.start.y);
+		const c = this.getColor(move.start.x,move.start.y);
+		// "l" = Alice king
+		if (piece == "l")
+		{
+			this.kingPos[c][0] = move.appear[0].x;
+			this.kingPos[c][1] = move.appear[0].y;
+			this.castleFlags[c] = [false,false];
+		}
 	}
-	static UndoOnBoard(board, move)
+
+	unupdateVariables(move)
 	{
-		for (let psq of move.appear)
-			board[psq.x][psq.y] = VariantRules.EMPTY;
-		for (let psq of move.vanish)
-			board[psq.x][psq.y] = psq.c + psq.p;
+		super.unupdateVariables(move);
+		const c = this.getColor(move.start.x,move.start.y);
+		if (this.getPiece(move.start.x,move.start.y) == "l")
+			this.kingPos[c] = [move.start.x, move.start.y];
 	}
 
 	checkGameEnd()
 	{
 		const color = this.turn;
-		// No valid move: stalemate or checkmate?
-		// TODO: here also, need to build the board with king on it
+		let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
+		let saveBoard = this.board;
+		this.board = sideBoard;
+		let res = "*";
 		if (!this.isAttacked(this.kingPos[color], this.getOppCol(color)))
-			return "1/2";
-		// OK, checkmate
-		return color == "w" ? "0-1" : "1-0";
+			res = "1/2";
+		else
+			res = (color == "w" ? "0-1" : "1-0");
+		this.board = saveBoard;
+		return res;
+	}
+
+	static get VALUES() {
+		return {
+			'p': 1,
+			's': 1,
+			'r': 5,
+			'u': 5,
+			'n': 3,
+			'o': 3,
+			'b': 3,
+			'c': 3,
+			'q': 9,
+			't': 9,
+			'k': 1000,
+			'l': 1000
+		};
+	}
+
+	getNotation(move)
+	{
+		if (move.appear.length == 2 && move.appear[0].p == VariantRules.KING)
+		{
+			if (move.end.y < move.start.y)
+				return "0-0-0";
+			else
+				return "0-0";
+		}
+
+		const finalSquare =
+			String.fromCharCode(97 + move.end.y) + (VariantRules.size[0]-move.end.x);
+		const piece = this.getPiece(move.start.x, move.start.y);
+
+		const captureMark = (move.vanish.length > move.appear.length ? "x" : "");
+		let pawnMark = "";
+		if (["p","s"].includes(piece) && captureMark.length == 1)
+			pawnMark = String.fromCharCode(97 + move.start.y); //start column
+
+		// Piece or pawn movement
+		let notation = piece.toUpperCase() + pawnMark + captureMark + finalSquare;
+		if (['s','p'].includes(piece) && !['s','p'].includes(move.appear[0].p))
+		{
+			// Promotion
+			notation += "=" + move.appear[0].p.toUpperCase();
+		}
+		return notation;
 	}
 }