Changeset 10426 for branches/HeuristicLab.Problems.GPDL/CodeGenerator/MonteCarloTreeSearchCodeGen.cs

Timestamp:

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

Author:

gkronber

Message:

#2026 generate code for all solvers

File:

• branches/HeuristicLab.Problems.GPDL/CodeGenerator/MonteCarloTreeSearchCodeGen.cs (modified) (9 diffs)

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?)