X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Fbase_rules.js;h=aff47109bed2fd2ae5179b136c8de60e36754c78;hb=9aeba28ad5f7417aaae64b3a863a7dde388dffe5;hp=0549139877e5ad5ebb1ed6bc54b318febb4ce212;hpb=d2af3400944331ffd0c770f83857257c2f48e487;p=vchess.git

diff --git a/client/src/base_rules.js b/client/src/base_rules.js
index 05491398..aff47109 100644
--- a/client/src/base_rules.js
+++ b/client/src/base_rules.js
@@ -442,8 +442,10 @@ export const ChessRules = class ChessRules {
       // if more than 9 consecutive free spaces, break the integer,
       // otherwise FEN parsing will fail.
       if (count <= 9) return count;
-      // Currently only boards of size up to 11 or 12:
-      return "9" + (count - 9);
+      // Most boards of size < 18:
+      if (count <= 18) return "9" + (count - 9);
+      // Except Gomoku:
+      return "99" + (count - 18);
     };
     let position = "";
     for (let i = 0; i < V.size.x; i++) {
@@ -1035,6 +1037,9 @@ export const ChessRules = class ChessRules {
 
   // Stop at the first move found
   // TODO: not really, it explores all moves from a square (one is enough).
+  // Possible fix: add extra arg "oneMove" to getPotentialMovesFrom,
+  // and then return only boolean true at first move found
+  // (in all getPotentialXXXMoves() ... for all variants ...)
   atLeastOneMove() {
     const color = this.turn;
     for (let i = 0; i < V.size.x; i++) {