Changeset 10426

Timestamp:

01/29/14 17:10:03 (10 years ago)

Author:

gkronber

Message:

#2026 generate code for all solvers

Location:

branches/HeuristicLab.Problems.GPDL/CodeGenerator

Files:

• BruteForceCodeGen.cs (modified) (4 diffs)
• MonteCarloTreeSearchCodeGen.cs (modified) (9 diffs)
• ProblemCodeGen.cs (modified) (3 diffs)
• RandomSearchCodeGen.cs (modified) (4 diffs)

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

@@ -12 +12 @@
 
 namespace ?PROBLEMNAME? {
-  public sealed class ?IDENT?Solver {
+  public sealed class ?IDENT?BruteForceSolver {
     private static int maxDepth = 20;
 
@@ -73 +73 @@
     }
 
-    public static void Main(string[] args) {
-      if(args.Length > 0) ParseArguments(args);
-      var problem = new ?IDENT?Problem();
-      var solver = new ?IDENT?Solver(problem);
-      solver.Start();
-    }
-    private static void ParseArguments(string[] args) {
+    private void ParseArguments(string[] args) {
       var maxDepthRegex = new Regex(@""--maxDepth=(?<d>.+)"");
 
@@ -97 +91 @@
       }
     }
-    private static void PrintUsage() {
+    private void PrintUsage() {
       Console.WriteLine(""Find a solution using brute force tree search."");
       Console.WriteLine();
@@ -106 +100 @@
 
 
-    public ?IDENT?Solver(?IDENT?Problem problem) {
+
+    public ?IDENT?BruteForceSolver(?IDENT?Problem problem, string[] args) {
+      if(args.Length>1) ParseArguments(args);
       this.problem = problem;
       this.random = new Random();
     }
 
-    private void Start() {
+    public void Start() {
       var bestF = ?MAXIMIZATION? ? double.NegativeInfinity : double.PositiveInfinity;
       int n = 0;

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

@@ -17 +17 @@
     public bool done;
     public SearchTreeNode[] children;
+    // only for debugging
     public double[] Ucb {
       get {
         return (from c in children
-                select ?IDENT?Solver.UCB(this, c)
+                select ?IDENT?MonteCarloTreeSearchSolver.UCB(this, c)
                ).ToArray();
       }
@@ -28 +29 @@
   }
 
-  public sealed class ?IDENT?Solver {
+  public sealed class ?IDENT?MonteCarloTreeSearchSolver {
+    private int maxDepth = 20;
 
     private readonly ?IDENT?Problem problem;
@@ -34 +36 @@
     private SearchTreeNode searchTree = new SearchTreeNode();
    
-    private Tree SampleTree() {
-      var extensionsStack = new Stack<Tuple<Tree, int, int>>(); // the unfinished tree, the state, and the index of the extension point
+    private Tree SampleTree(int maxDepth) {
+      var extensionsStack = new Stack<Tuple<Tree, int, int, int>>(); // the unfinished tree, the state, the index of the extension point and the maximal depth of a tree inserted at that point
       var t = new Tree(-1, new Tree[1]);
-      extensionsStack.Push(Tuple.Create(t, 0, 0));
+      extensionsStack.Push(Tuple.Create(t, 0, 0, maxDepth));
       SampleTree(searchTree, extensionsStack);
       return t.subtrees[0];
     }
 
-    private void SampleTree(SearchTreeNode searchTree, Stack<Tuple<Tree, int, int>> extensionPoints) {
+    private void SampleTree(SearchTreeNode searchTree, Stack<Tuple<Tree, int, int, int>> extensionPoints) {
       const int RANDOM_TRIES = 1000;
       if(extensionPoints.Count == 0) {
@@ -52 +54 @@
       int state = extensionPoint.Item2;
       int subtreeIdx = extensionPoint.Item3;
+      int maxDepth = extensionPoint.Item4;
+      Debug.Assert(maxDepth >= 1);
       Tree t = null;
       if(searchTree.tries < RANDOM_TRIES || Grammar.subtreeCount[state] == 0) {
@@ -81 +85 @@
           var altIdx = SelectAlternative(searchTree);
           t = new Tree(altIdx, new Tree[1]);
-          extensionPoints.Push(Tuple.Create(t, Grammar.transition[state][altIdx], 0));
+          extensionPoints.Push(Tuple.Create(t, Grammar.transition[state][altIdx], 0, maxDepth - 1));
           SampleTree(searchTree.children[altIdx], extensionPoints);
         } else {
@@ -88 +92 @@
           t = new Tree(-1, subtrees);
           for(int i = subtrees.Length - 1; i >= 0; i--) {
-            extensionPoints.Push(Tuple.Create(t, Grammar.transition[state][i], i));
+            extensionPoints.Push(Tuple.Create(t, Grammar.transition[state][i], i, maxDepth - 1));
           }
           SampleTree(searchTree, extensionPoints);          
@@ -215 +219 @@
     }
 
-
-    public static void Main(string[] args) {
-      // if(args.Length >= 1) ParseArguments(args);
-
-      var problem = new ?IDENT?Problem();
-      var solver = new ?IDENT?Solver(problem);
-      solver.Start();
-    }
-
-    public ?IDENT?Solver(?IDENT?Problem problem) {
+    public ?IDENT?MonteCarloTreeSearchSolver(?IDENT?Problem problem, string[] args) {
+      if(args.Length > 0 ) throw new ArgumentException(""Arguments ""+args.Aggregate("""", (str, s) => str+ "" "" + s)+"" are not supported "");
       this.problem = problem;
       this.random = new Random();
     }
 
-    private void Start() {
+    public void Start() {
       Console.ReadLine();
       var bestF = ?MAXIMIZATION? ? double.NegativeInfinity : double.PositiveInfinity;
@@ -241 +237 @@
 
         int steps, depth;
-        var _t = SampleTree();
+        var _t = SampleTree(maxDepth);
         //  _t.PrintTree(0); Console.WriteLine();
 
@@ -247 +243 @@
         steps = _t.GetSize();
         depth = _t.GetDepth();
+        Debug.Assert(depth <= maxDepth);
         var f = problem.Evaluate(_t);
         if(?MAXIMIZATION?)

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

@@ -1 @@
-using System.Collections.Generic;
+using System;
+using System.Collections.Generic;
 using System.Diagnostics;
 using System.IO;
@@ -19 +20 @@
     private const string problemTemplate = @"
 namespace ?PROBLEMNAME? {
+
+
+
+
   public sealed class ?IDENT?Problem {
+    public static void Main(string[] args) {
+      var problem = new ?IDENT?Problem();
+      var solver = new ?IDENT?RandomSearchSolver(problem, args);
+      solver.Start();
+    }
    
    public ?IDENT?Problem() { 
@@ -153 +163 @@
     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 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);
+      try {
+        var randomSearchCodeGen = new RandomSearchCodeGen();
+        randomSearchCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization,
+                                     solverSourceCode);
+      }
+      catch (Exception e) {
+        Console.WriteLine(e.Message);
+      }
+      try {
+        var bruteForceSearchCodeGen = new BruteForceCodeGen();
+        bruteForceSearchCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization, solverSourceCode);
+      }
+      catch (Exception e) {
+        Console.WriteLine(e.Message);
+      }
+      try {
+        var mctsCodeGen = new MonteCarloTreeSearchCodeGen();
+        mctsCodeGen.Generate(grammar, ast.Terminals.OfType<TerminalNode>(), ast.FitnessFunctionNode.Maximization,
+                             solverSourceCode);
+      }
+      catch (Exception e) {
+        Console.WriteLine(e.Message);
+      }
     }
 

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

@@ -11 +11 @@
     private string solverTemplate = @"
 namespace ?PROBLEMNAME? {
-  public sealed class ?IDENT?Solver {
-    private static double baseTerminalProbability = 0.05; // 5% of all samples are only a terminal node
-    private static double terminalProbabilityInc = 0.05; // for each level the probability to sample a terminal grows by 5%
+  public sealed class ?IDENT?RandomSearchSolver {
+    private double baseTerminalProbability = 0.05; // 5% of all samples are only a terminal node
+    private double terminalProbabilityInc = 0.05; // for each level the probability to sample a terminal grows by 5%
     private static int maxDepth = 20;
 
@@ -77 +77 @@
     }
 
-    public static void Main(string[] args) {
-      if(args.Length >= 1) ParseArguments(args);
-
-      var problem = new ?IDENT?Problem();
-      var solver = new ?IDENT?Solver(problem);
-      solver.Start();
-    }
-    private static void ParseArguments(string[] args) {
+    private void ParseArguments(string[] args) {
       var baseTerminalProbabilityRegex = new Regex(@""--terminalProbBase=(?<prob>.+)"");
       var terminalProbabilityIncRegex = new Regex(@""--terminalProbInc=(?<prob>.+)"");
@@ -111 +104 @@
       }
     }
-    private static void PrintUsage() {
+    private void PrintUsage() {
       Console.WriteLine(""Find a solution using random tree search."");
       Console.WriteLine();
@@ -121 +114 @@
 
 
-    public ?IDENT?Solver(?IDENT?Problem problem) {
+    public ?IDENT?RandomSearchSolver(?IDENT?Problem problem, string[] args) {
+      if(args.Length >= 1) ParseArguments(args);
+
       this.problem = problem;
       this.random = new Random();
     }
 
-    private void Start() {
+    public void Start() {
       var bestF = ?MAXIMIZATION? ? double.NegativeInfinity : double.PositiveInfinity;
       int n = 0;