X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FAlice.js;h=16ccb84deec962d562d226119215a36f41df9a68;hb=8d8a70d9c1b699075e0d4313cabe5cc0269a7840;hp=a3d3ff434082368209f5172882b2503f361b29ad;hpb=b9ce3d0fbe6cf8cba01912706ad578144bc9b42f;p=vchess.git

diff --git a/client/src/variants/Alice.js b/client/src/variants/Alice.js
index a3d3ff43..16ccb84d 100644
--- a/client/src/variants/Alice.js
+++ b/client/src/variants/Alice.js
@@ -5,6 +5,7 @@ import { ArrayFun } from "@/utils/array";
 // TODO? atLeastOneMove() would be more efficient if rewritten here
 // (less sideBoard computations)
 export class AliceRules extends ChessRules {
+
   static get ALICE_PIECES() {
     return {
       s: "p",
@@ -72,7 +73,7 @@ export class AliceRules extends ChessRules {
         if (['K','k','L','l'].includes(row[i])) kings[row[i]]++;
         if (V.PIECES.includes(row[i].toLowerCase())) sumElts++;
         else {
-          const num = parseInt(row[i]);
+          const num = parseInt(row[i], 10);
           if (isNaN(num)) return false;
           sumElts += num;
         }
@@ -101,7 +102,7 @@ export class AliceRules extends ChessRules {
               this.kingPos["w"] = [i, k];
               break;
             default: {
-              const num = parseInt(rows[i].charAt(j));
+              const num = parseInt(rows[i].charAt(j), 10);
               if (!isNaN(num)) k += num - 1;
             }
           }
@@ -361,10 +362,10 @@ export class AliceRules extends ChessRules {
 
     // Piece or pawn movement
     let notation = piece.toUpperCase() + pawnMark + captureMark + finalSquare;
-    if (["s", "p"].includes(piece) && !["s", "p"].includes(move.appear[0].p)) {
+    if (["s", "p"].includes(piece) && !["s", "p"].includes(move.appear[0].p))
       // Promotion
       notation += "=" + move.appear[0].p.toUpperCase();
-    }
     return notation;
   }
+
 };