Changeset 12050 for branches

Timestamp:

02/22/15 22:08:20 (10 years ago)

Author:

aballeit

Message:

#2283: first MCTS algorithmus concept

Location:

branches/HeuristicLab.Problems.GrammaticalOptimization

Files:

• GrammaticalOptimization.sln (modified) (3 diffs)
• HeuristicLab.Algorithms.MonteCarloTreeSearch (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Base (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Base/TreeNode.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Expansion (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Expansion/IExpansionPolicy.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Expansion/RandomExpansionPolicy.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/HeuristicLab.Algorithms.MonteCarloTreeSearch.csproj (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Properties (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Properties/AssemblyInfo.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Simulation (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Simulation/ISimulationPolicy.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/Simulation/RandomSimulationPolicy.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/bin (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/bin/Debug (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/bin/Release (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug/DesignTimeResolveAssemblyReferencesInput.cache (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug/TempPE (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug/TemporaryGeneratedFile_036C0B5B-1481-4323-8D20-8F5ADCB23D92.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug/TemporaryGeneratedFile_5937a670-0e60-4077-877b-f7221da3dda1.cs (added)
• HeuristicLab.Algorithms.MonteCarloTreeSearch/obj/Debug/TemporaryGeneratedFile_E7A71F73-0F8D-4B9B-B56E-8E70B10BC5D3.cs (added)
• Main/Program.cs (modified) (1 diff)

branches/HeuristicLab.Problems.GrammaticalOptimization/GrammaticalOptimization.sln

@@ -1 +1 @@
 
 Microsoft Visual Studio Solution File, Format Version 12.00
-# Visual Studio 2012
+# Visual Studio 2013
+VisualStudioVersion = 12.0.31101.0
+MinimumVisualStudioVersion = 10.0.40219.1
 Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "HeuristicLab.Problems.GrammaticalOptimization", "HeuristicLab.Problems.GrammaticalOptimization\HeuristicLab.Problems.GrammaticalOptimization.csproj", "{CB9DCCF6-667E-4A13-B82D-DBD6B45A045E}"
 EndProject
@@ -59 +61 @@
   EndProjectSection
 EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "HeuristicLab.Algorithms.MonteCarloTreeSearch", "HeuristicLab.Algorithms.MonteCarloTreeSearch\HeuristicLab.Algorithms.MonteCarloTreeSearch.csproj", "{2C115235-8FA9-4F7F-B3A0-A0144F8A35CA}"
+EndProject
 Global
   GlobalSection(SolutionConfigurationPlatforms) = preSolution
@@ -105 +109 @@
     {8B4C199E-C08B-479E-9B82-6AE5B113459E}.Release|Any CPU.ActiveCfg = Release|Any CPU
     {8B4C199E-C08B-479E-9B82-6AE5B113459E}.Release|Any CPU.Build.0 = Release|Any CPU
+    {2C115235-8FA9-4F7F-B3A0-A0144F8A35CA}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+    {2C115235-8FA9-4F7F-B3A0-A0144F8A35CA}.Debug|Any CPU.Build.0 = Debug|Any CPU
+    {2C115235-8FA9-4F7F-B3A0-A0144F8A35CA}.Release|Any CPU.ActiveCfg = Release|Any CPU
+    {2C115235-8FA9-4F7F-B3A0-A0144F8A35CA}.Release|Any CPU.Build.0 = Release|Any CPU
   EndGlobalSection
   GlobalSection(SolutionProperties) = preSolution

branches/HeuristicLab.Problems.GrammaticalOptimization/Main/Program.cs

@@ -36 +36 @@
       var random = new Random();
 
-      var problem = new SymbolicRegressionPoly10Problem();
+      //var problem = new SymbolicRegressionPoly10Problem();
       //var problem = new SantaFeAntProblem();              
-      //var problem = new RoyalPairProblem();
+      var problem = new RoyalPairProblem();
       //var problem = new EvenParityProblem();
       var alg = new SequentialSearch(problem, 23, random, 0,