Attempt to fix Alice chess
[vchess.git] / public / javascripts / variants / Alice.js
1 class AliceRules extends ChessRules
2 {
3 static get ALICE_PIECES()
4 {
5 return {
6 's': 'p',
7 't': 'q',
8 'u': 'r',
9 'c': 'b',
10 'o': 'n',
11 'l': 'k',
12 };
13 }
14 static get ALICE_CODES()
15 {
16 return {
17 'p': 's',
18 'q': 't',
19 'r': 'u',
20 'b': 'c',
21 'n': 'o',
22 'k': 'l',
23 };
24 }
25
26 static getPpath(b)
27 {
28 return (Object.keys(this.ALICE_PIECES).includes(b[1]) ? "Alice/" : "") + b;
29 }
30
31 initVariables(fen)
32 {
33 super.initVariables(fen);
34 const fenParts = fen.split(" ");
35 const position = fenParts[0].split("/");
36 if (this.kingPos["w"][0] < 0 || this.kingPos["b"][0] < 0)
37 {
38 // INIT_COL_XXX won't be used, so no need to set them for Alice kings
39 for (let i=0; i<position.length; i++)
40 {
41 let k = 0; //column index on board
42 for (let j=0; j<position[i].length; j++)
43 {
44 switch (position[i].charAt(j))
45 {
46 case 'l':
47 this.kingPos['b'] = [i,k];
48 break;
49 case 'L':
50 this.kingPos['w'] = [i,k];
51 break;
52 default:
53 let num = parseInt(position[i].charAt(j));
54 if (!isNaN(num))
55 k += (num-1);
56 }
57 k++;
58 }
59 }
60 }
61 }
62
63 getBoardOfPiece([x,y])
64 {
65 const V = VariantRules;
66 // Build board where the piece is
67 const mirrorSide = (Object.keys(V.ALICE_CODES).includes(this.getPiece(x,y)) ? 1 : 2);
68 // Build corresponding board from complete board
69 const [sizeX,sizeY] = V.size;
70 let sideBoard = doubleArray(sizeX, sizeY, "");
71 for (let i=0; i<sizeX; i++)
72 {
73 for (let j=0; j<sizeY; j++)
74 {
75 const piece = this.getPiece(i,j);
76 if (mirrorSide==1 && Object.keys(V.ALICE_CODES).includes(piece))
77 sideBoard[i][j] = this.board[i][j];
78 else if (mirrorSide==2 && Object.keys(V.ALICE_PIECES).includes(piece))
79 sideBoard[i][j] = this.getColor(i,j) + V.ALICE_PIECES[piece];
80 }
81 }
82 return sideBoard;
83 }
84
85 // TODO: move board building one level up (findAllMoves()) to avoid re-building at every piece...
86 // NOTE: castle & enPassant https://www.chessvariants.com/other.dir/alice.html
87 // --> Should be OK as is.
88 getPotentialMovesFrom([x,y])
89 {
90 let sideBoard = this.getBoardOfPiece([x,y]);
91
92 // Search valid moves on sideBoard
93 let saveBoard = this.board;
94 this.board = sideBoard;
95 let moves = super.getPotentialMovesFrom([x,y]);
96 this.board = saveBoard;
97
98 // Finally filter impossible moves
99 const mirrorSide = (Object.keys(VariantRules.ALICE_CODES).includes(this.getPiece(x,y)) ? 1 : 2);
100 return moves.filter(m => {
101 if (m.appear.length == 2) //castle
102 {
103 // If appear[i] not in vanish array, then must be empty square on other board
104 m.appear.forEach(psq => {
105 if (this.board[psq.x][psq.y] != VariantRules.EMPTY &&
106 ![m.vanish[0].y,m.vanish[1].y].includes(psq.y))
107 {
108 return false;
109 }
110 });
111 }
112 else if (this.board[m.end.x][m.end.y] != VariantRules.EMPTY)
113 {
114 // Attempt to capture
115 const piece = this.getPiece(m.end.x,m.end.y);
116 if ((mirrorSide==1 && Object.keys(VariantRules.ALICE_PIECES).includes(piece))
117 || (mirrorSide==2 && Object.keys(VariantRules.ALICE_CODES).includes(piece)))
118 {
119 return false;
120 }
121 }
122 // If the move is computed on board1, m.appear change for Alice pieces.
123 if (mirrorSide==1)
124 {
125 m.appear.forEach(psq => { //forEach: castling taken into account
126 psq.p = VariantRules.ALICE_CODES[psq.p]; //goto board2
127 });
128 }
129 else //move on board2: mark vanishing pieces as Alice
130 {
131 m.vanish.forEach(psq => {
132 psq.p = VariantRules.ALICE_CODES[psq.p];
133 });
134 }
135 return true;
136 });
137 }
138
139 underCheck(move)
140 {
141 const color = this.turn;
142 this.play(move);
143 let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
144 let saveBoard = this.board;
145 this.board = sideBoard;
146 let res = this.isAttacked(this.kingPos[color], this.getOppCol(color));
147 this.board = saveBoard;
148 this.undo(move);
149 return res;
150 }
151
152 getCheckSquares(move)
153 {
154 this.play(move);
155 const color = this.turn; //opponent
156 let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
157 let saveBoard = this.board;
158 this.board = sideBoard;
159 let res = this.isAttacked(this.kingPos[color], this.getOppCol(color))
160 ? [ JSON.parse(JSON.stringify(this.kingPos[color])) ]
161 : [ ];
162 this.board = saveBoard;
163 this.undo(move);
164 return res;
165 }
166
167 updateVariables(move)
168 {
169 super.updateVariables(move); //standard king
170 const piece = this.getPiece(move.start.x,move.start.y);
171 const c = this.getColor(move.start.x,move.start.y);
172 // "l" = Alice king
173 if (piece == "l")
174 {
175 this.kingPos[c][0] = move.appear[0].x;
176 this.kingPos[c][1] = move.appear[0].y;
177 this.castleFlags[c] = [false,false];
178 }
179 }
180
181 unupdateVariables(move)
182 {
183 super.unupdateVariables(move);
184 const c = this.getColor(move.start.x,move.start.y);
185 if (this.getPiece(move.start.x,move.start.y) == "l")
186 this.kingPos[c] = [move.start.x, move.start.y];
187 }
188
189 getNotation(move)
190 {
191 if (move.appear.length == 2 && move.appear[0].p == VariantRules.KING)
192 {
193 if (move.end.y < move.start.y)
194 return "0-0-0";
195 else
196 return "0-0";
197 }
198
199 const finalSquare =
200 String.fromCharCode(97 + move.end.y) + (VariantRules.size[0]-move.end.x);
201 const piece = this.getPiece(move.start.x, move.start.y);
202
203 // Piece or pawn movement
204 let notation = piece.toUpperCase() +
205 (move.vanish.length > move.appear.length ? "x" : "") + finalSquare;
206 if (['s','p'].includes(piece) && !['s','p'].includes(move.appear[0].p))
207 {
208 // Promotion
209 notation += "=" + move.appear[0].p.toUpperCase();
210 }
211 return notation;
212 }
213
214 checkGameEnd()
215 {
216 const color = this.turn;
217 let sideBoard = this.getBoardOfPiece(this.kingPos[color]);
218 let saveBoard = this.board;
219 this.board = sideBoard;
220 let res = "*";
221 if (!this.isAttacked(this.kingPos[color], this.getOppCol(color)))
222 res = "1/2";
223 else
224 res = (color == "w" ? "0-1" : "1-0");
225 this.board = saveBoard;
226 return res;
227 }
228 }