Changeset 13492 for branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch

Timestamp:

01/10/16 17:13:27 (9 years ago)

Author:

aballeit

Message:

#2283 UCT parameter c

Location:

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch

Files:

• Base/TreeNode.cs (modified) (1 diff)
• MonteCarloTreeSearch.cs (modified) (5 diffs)
• MonteCarloTreeSearch_PruneLeaves.cs (modified) (2 diffs)

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/Base/TreeNode.cs

@@ -1 @@
-using System;
+using HeuristicLab.Algorithms.Bandits;
 using System.Collections.Generic;
 using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using HeuristicLab.Algorithms.Bandits;
-using HeuristicLab.Algorithms.Bandits.BanditPolicies;
-using HeuristicLab.Problems.GrammaticalOptimization;
 
 namespace HeuristicLab.Algorithms.MonteCarloTreeSearch.Base

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch.cs

@@ -86 +86 @@
                         currentNode.GetChildActionInfos());
                     currentNode = currentNode.children[currentActionIndex];
-                    selections++;
-                    CheckSelection(currentNode, selections);
+                    //selections++;
+                    //CheckSelection(currentNode, selections);
                 }
 
@@ -98 +98 @@
                         currentNode.children[behaviourPolicy.SelectAction(random, currentNode.GetChildActionInfos())
                             ];
-                    selections++;
-                    CheckSelection(currentNode, selections);
+                    //selections++;
+                    //CheckSelection(currentNode, selections);
                 }
                 if (currentNode.phrase.Length <= maxLen)
@@ -223 +223 @@
         public byte[] GenerateSvg()
         {
-            if (GetTreeInfos().TotalNodes < 1000)
+            if (GetTreeInfos().TotalNodes < 6000)
             {
                 IGetStartProcessQuery getStartProcessQuery = new GetStartProcessQuery();
@@ -233 +233 @@
                     getProcessStartInfoQuery,
                     registerLayoutPluginCommand);
-                wrapper.GraphvizPath = @"../../../Graphviz2.38/bin";
+                wrapper.GraphvizPath = @"../../../../Graphviz2.38/bin";
                 StringBuilder dotFile = new StringBuilder("digraph {");
                 dotFile.AppendLine();
@@ -279 +279 @@
                         foreach (TreeNode childNode in currentNode.children)
                         {
-                            toDoNodes.Add(childNode);
-                            // declare node
-
-                            string hexColor = GetHexNodeColor(Color.White, Color.OrangeRed, childNode.actionInfo.Value);
-                            dotFile.AppendLine(
-                                string.Format("{0} [label=\"{1}\\n{2:0.00}/{3}\", style=filled, fillcolor=\"{4}\"]",
-                                    childNode.GetHashCode(),
-                                    childNode.phrase, childNode.actionInfo.Value, childNode.actionInfo.Tries, hexColor));
-                            // add edge
-                            dotFile.AppendLine(string.Format("{0} -> {1}", currentNode.GetHashCode(),
-                                childNode.GetHashCode()));
+                            if (childNode.actionInfo.Tries > 1)
+                            {
+                                toDoNodes.Add(childNode);
+                                // declare node
+
+                                string hexColor = GetHexNodeColor(Color.White, Color.OrangeRed,
+                                    childNode.actionInfo.Value);
+                                dotFile.AppendLine(
+                                    string.Format("{0} [label=\"{1}\\n{2:0.00}/{3}\", style=filled, fillcolor=\"{4}\"]",
+                                        childNode.GetHashCode(),
+                                        childNode.phrase, childNode.actionInfo.Value, childNode.actionInfo.Tries,
+                                        hexColor));
+                                // add edge
+                                dotFile.AppendLine(string.Format("{0} -> {1}", currentNode.GetHashCode(),
+                                    childNode.GetHashCode()));
+                            }
                         }
                     }

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch_PruneLeaves.cs

@@ -48 +48 @@
                         // already removed all child nodes so remove it too..
                         currentNode.parent.RemoveChildren(currentNode);
+                        i--;
                         continue;
                     }
@@ -75 +76 @@
                     Propagate(currentNode, quality);
                 }
+                else
+                {
+                    i--;
+
+                }
             }
         }