projects
/
vchess.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Add Castle Chess
[vchess.git]
/
client
/
src
/
variants
/
Absorption.js
diff --git
a/client/src/variants/Absorption.js
b/client/src/variants/Absorption.js
index
7a9ff3c
..
64c03e6
100644
(file)
--- a/
client/src/variants/Absorption.js
+++ b/
client/src/variants/Absorption.js
@@
-49,8
+49,8
@@
export class AbsorptionRules extends ChessRules {
// p1 or p2 already have knight + other piece
return (p1 == V.KNIGHT ? p2 : p1);
}
// p1 or p2 already have knight + other piece
return (p1 == V.KNIGHT ? p2 : p1);
}
+ if ([p1, p2].includes(V.QN)) return V.QN;
for (let p of [p1, p2]) {
for (let p of [p1, p2]) {
- if (p == V.QN) return V.QN;
if ([V.BN, V.RN].includes(p))
return V.MergeComposed[[p1, p2].sort().join("")];
}
if ([V.BN, V.RN].includes(p))
return V.MergeComposed[[p1, p2].sort().join("")];
}
@@
-80,6
+80,15
@@
export class AbsorptionRules extends ChessRules {
default:
moves = super.getPotentialMovesFrom(sq);
}
default:
moves = super.getPotentialMovesFrom(sq);
}
+ // Filter out capturing promotions (except one),
+ // because they are all the same.
+ moves = moves.filter(m => {
+ return (
+ m.vanish.length == 1 ||
+ m.vanish[0].p != V.PAWN ||
+ [V.PAWN, V.QUEEN].includes(m.appear[0].p)
+ );
+ });
moves.forEach(m => {
if (m.vanish.length == 2) {
// Augment pieces abilities in case of captures
moves.forEach(m => {
if (m.vanish.length == 2) {
// Augment pieces abilities in case of captures