Return SearchMeasures and expose solution mappings (#206)

README.org

@@ -32,7 +32,7 @@ Each letter represents a digit, and the goal is to reconstruct the original arit
 ** Prerequisites
   This project works on 32 bits and 64 bits environment and requires:
 
-  - JDK 11+
+  - JDK 17+
   - Maven 3+
   - Cryptarithmetic Puzzle Solver in C (optional)
     - Download it from [[https://tamura70.gitlab.io/web-puzzle/cryptarithm/][Naoyuki Tamura Website]].

src/main/java/cryptator/Cryptator.java

@@ -109,7 +109,7 @@ private static long solve(final String cryptarithm, final CryptaParserWrapper pa
             final ICryptaNode node = parseCryptarithm(cryptarithm, parser, LOGGER);
 
             final CryptaBiConsumer consumer = buildBiConsumer(config);
-            final boolean solved = solver.solve(node, config, consumer);
+            final boolean solved = solver.solve(node, config, consumer).isFeasible();
             String status = "ERROR";
             if (consumer.getErrorCount() == 0) {
                 status = solved ? "OK" : "KO";

src/main/java/cryptator/game/CryptaGameEngine.java

@@ -52,7 +52,7 @@ private boolean solveGame() {
 
     @Override
     public boolean isSolved() {
-        return userModel.getSolution().isTotalSolution();
+        return userModel.getSolution().isTotalAssignment();
     }
 
     private static CryptaModel makeUserDecisionModel(final CryptaModel model) {