X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FSuicide.js;h=13aaa6bba4bda2543da804b91fed538dc41e14b9;hb=5d74fceaa93054b410f469fe6ed4d5a4609bf98d;hp=e3630bb408ae7a9df11a3c82beb74bf8c407c760;hpb=8e346ebebfdaec1538f9728fa7a279027c990f78;p=vchess.git

diff --git a/client/src/variants/Suicide.js b/client/src/variants/Suicide.js
index e3630bb4..13aaa6bb 100644
--- a/client/src/variants/Suicide.js
+++ b/client/src/variants/Suicide.js
@@ -3,6 +3,7 @@ import { ArrayFun } from "@/utils/array";
 import { shuffle } from "@/utils/alea";
 
 export class SuicideRules extends ChessRules {
+
   static get HasFlags() {
     return false;
   }
@@ -28,7 +29,8 @@ export class SuicideRules extends ChessRules {
         if (V.PIECES.includes(lowerRi)) {
           pieces[row[i] == lowerRi ? "b" : "w"]++;
           sumElts++;
-        } else {
+        }
+        else {
           const num = parseInt(row[i], 10);
           if (isNaN(num)) return false;
           sumElts += num;
@@ -151,8 +153,10 @@ export class SuicideRules extends ChessRules {
       if (rem2 == positions[1] % 2) {
         // Fix bishops (on different colors)
         for (let i=2; i<8; i++) {
-          if (positions[i] % 2 != rem2)
+          if (positions[i] % 2 != rem2) {
             [positions[1], positions[i]] = [positions[i], positions[1]];
+            break;
+          }
         }
       }
       for (let i = 0; i < 8; i++) pieces[c][positions[i]] = composition[i];
@@ -165,4 +169,5 @@ export class SuicideRules extends ChessRules {
       " w 0 -"
     );
   }
+
 };