projects
/
vchess.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Some fixes
[vchess.git]
/
client
/
src
/
base_rules.js
diff --git
a/client/src/base_rules.js
b/client/src/base_rules.js
index
f51e8d0
..
e142839
100644
(file)
--- a/
client/src/base_rules.js
+++ b/
client/src/base_rules.js
@@
-191,9
+191,9
@@
export const ChessRules = class ChessRules {
return V.CoordToColumn(coords.y) + (V.size.x - coords.x);
}
return V.CoordToColumn(coords.y) + (V.size.x - coords.x);
}
- // Path to pieces
+ // Path to pieces
(standard ones in pieces/ folder)
getPpath(b) {
getPpath(b) {
- return b;
//usual pieces in pieces/ folder
+ return b;
}
// Path to promotion pieces (usually the same)
}
// Path to promotion pieces (usually the same)
@@
-226,7
+226,7
@@
export const ChessRules = class ChessRules {
if (
Math.abs(s.x - e.x) == 2 &&
s.y == e.y &&
if (
Math.abs(s.x - e.x) == 2 &&
s.y == e.y &&
- move.appear[0].p == V.PAWN
+ (move.appear.length > 0 && move.appear[0].p == V.PAWN)
) {
return {
x: (s.x + e.x) / 2,
) {
return {
x: (s.x + e.x) / 2,
@@
-1101,7
+1101,9
@@
export const ChessRules = class ChessRules {
) {
const flagIdx = (move.start.y == this.castleFlags[c][0] ? 0 : 1);
this.castleFlags[c][flagIdx] = V.size.y;
) {
const flagIdx = (move.start.y == this.castleFlags[c][0] ? 0 : 1);
this.castleFlags[c][flagIdx] = V.size.y;
- } else if (
+ }
+ // NOTE: not "else if" because a rook could take an opposing rook
+ if (
move.end.x == oppFirstRank && //we took opponent rook?
this.castleFlags[oppCol].includes(move.end.y)
) {
move.end.x == oppFirstRank && //we took opponent rook?
this.castleFlags[oppCol].includes(move.end.y)
) {
@@
-1282,8
+1284,8
@@
export const ChessRules = class ChessRules {
}
let candidates = [0];
}
let candidates = [0];
- for (let
j = 1; j < moves1.length && moves1[j].eval == moves1[0].eval; j
++)
- candidates.push(
j
);
+ for (let
i = 1; i < moves1.length && moves1[i].eval == moves1[0].eval; i
++)
+ candidates.push(
i
);
return moves1[candidates[randInt(candidates.length)]];
}
return moves1[candidates[randInt(candidates.length)]];
}