Changeset 10400

Timestamp:

01/26/14 14:37:40 (11 years ago)

Author:

gkronber

Message:

#2026 worked on MCTS solver

Location:

branches/HeuristicLab.Problems.GPDL/CodeGenerator

Files:

• BruteForceCodeGen.cs (modified) (2 diffs)
• CodeGenerator.csproj (modified) (1 diff)
• ProblemCodeGen.cs (modified) (1 diff)
• RandomSearchCodeGen.cs (modified) (2 diffs)

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

@@ -98 +98 @@
         foreach(var t in GenerateTrees(0, depth)) {
           var f = problem.Evaluate(t);
-          // t.PrintTree(0); Console.WriteLine();
           var size = t.GetSize();
           sumSize += size;
@@ -105 +104 @@
           sumF += f;
           if (problem.IsBetter(f, bestF)) {
+            t.PrintTree(0); Console.WriteLine();
             bestF = f;
             t.PrintTree(0); Console.WriteLine();

branches/HeuristicLab.Problems.GPDL/CodeGenerator/CodeGenerator.csproj

@@ -37 +37 @@
   <ItemGroup>
     <Compile Include="BruteForceCodeGen.cs" />
+    <Compile Include="MonteCarloTreeSearchCodeGen.cs" />
     <Compile Include="ProblemCodeGen.cs" />
     <Compile Include="SourceBuilder.cs" />

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

@@ -149 +149 @@
     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 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);
     }
 

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

@@ -124 +124 @@
       var sw = new System.Diagnostics.Stopwatch();
       sw.Start();
-      while (n <= 10000) {
+      while (true) {
 
         int steps, depth;
@@ -136 +136 @@
         if (problem.IsBetter(f, bestF)) {
           bestF = f;
+          _t.PrintTree(0); Console.WriteLine();
           Console.WriteLine(""{0}\t{1}\t(size={2}, depth={3})"", n, bestF, steps, depth);
         }