X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fvariants%2FAmbiguous.js;h=b478887db1afa5ae87f7fe9264ac0cd523e51b01;hb=5d74fceaa93054b410f469fe6ed4d5a4609bf98d;hp=17e5283a906257d27be4b92a63e5f245248561f3;hpb=031b3d0786bc6c4f250e9832c5547847062e83b8;p=vchess.git

diff --git a/client/src/variants/Ambiguous.js b/client/src/variants/Ambiguous.js
index 17e5283a..b478887d 100644
--- a/client/src/variants/Ambiguous.js
+++ b/client/src/variants/Ambiguous.js
@@ -3,6 +3,7 @@ import { randInt, shuffle } from "@/utils/alea";
 import { ArrayFun } from "@/utils/array";
 
 export class AmbiguousRules extends ChessRules {
+
   static get HasFlags() {
     return false;
   }
@@ -249,8 +250,10 @@ export class AmbiguousRules 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];
@@ -292,4 +295,5 @@ export class AmbiguousRules extends ChessRules {
     else move.vanish[1].p = V.TARGET_CODE[move.vanish[1].p];
     return notation;
   }
+
 };