Changeset 10424 for branches/HeuristicLab.Problems.GPDL/CodeGenerator/ProblemCodeGen.cs

Timestamp:

01/29/14 16:17:20 (10 years ago)

Author:

gkronber

Message:

#2026 maximal depth limit for random search

File:

• branches/HeuristicLab.Problems.GPDL/CodeGenerator/ProblemCodeGen.cs (modified) (4 diffs)

branches/HeuristicLab.Problems.GPDL/CodeGenerator/ProblemCodeGen.cs

@@ -101 +101 @@
        { -1, 0 }, // terminals
 ?SUBTREECOUNTTABLE?
+    };
+    public static readonly Dictionary<int, int> minDepth = new Dictionary<int, int>() {
+?MINDEPTHTABLE?
     };
     public static readonly string[] symb = new string[] { ?SYMBOLNAMES? };
@@ -144 +147 @@
         .Replace("?TRANSITIONTABLE?", GenerateTransitionTable(grammar))
         .Replace("?SUBTREECOUNTTABLE?", GenerateSubtreeCountTable(grammar))
+        .Replace("?MINDEPTHTABLE?", GenerateMinDepthTable(grammar))
        ;
     }
@@ -149 +153 @@
     private void GenerateSolvers(GPDefNode ast, SourceBuilder solverSourceCode) {
       var grammar = CreateGrammarFromAst(ast);
-      // var randomSearchCodeGen = new RandomSearchCodeGen();
-      // randomSearchCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
+      var randomSearchCodeGen = new RandomSearchCodeGen();
+      randomSearchCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
       // var bruteForceSearchCodeGen = new BruteForceCodeGen();
       // bruteForceSearchCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
-      var mctsCodeGen = new MonteCarloTreeSearchCodeGen();
-      mctsCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
+      // var mctsCodeGen = new MonteCarloTreeSearchCodeGen();
+      // mctsCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
     }
 
@@ -428 +432 @@
       return sb.ToString();
     }
-
+    private string GenerateMinDepthTable(IGrammar grammar) {
+      var sb = new SourceBuilder();
+      var minDepth = new Dictionary<ISymbol, int>();
+      foreach (var s in grammar.TerminalSymbols) {
+        minDepth[s] = 1;
+      }
+      while (minDepth.Count < grammar.Symbols.Count()) {
+        foreach (var s in grammar.NonTerminalSymbols) {
+          if (grammar.NumberOfAlternatives(s) > 1) {
+            // alternatives
+            if (grammar.GetAlternatives(s).Any(alt => minDepth.ContainsKey(alt.Single()))) {
+              minDepth[s] = (grammar.GetAlternatives(s)
+                .Where(alt => minDepth.ContainsKey(alt.Single()))
+                .Select(alt => minDepth[alt.Single()]))
+                .Min() + 1;
+            }
+          } else {
+            // sequences
+            if (grammar.GetAlternatives(s).Single().All(c => minDepth.ContainsKey(c))) {
+              minDepth[s] = (grammar.GetAlternatives(s).Single().Select(c => minDepth[c])).Max() + 1;
+            }
+          }
+        }
+      }
+      var allSymbols = grammar.Symbols.ToList();
+      foreach (var s in grammar.Symbols) {
+        sb.AppendFormat("// {0}", s).AppendLine();
+        sb.AppendFormat("{{ {0}, {1} }}, ", allSymbols.IndexOf(s), minDepth[s]).AppendLine();
+      }
+      return sb.ToString();
+    }
   }
 }