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

Timestamp:

08/03/15 00:03:18 (9 years ago)

Author:

aballeit

Message:

#2283 limit parallelism

Location:

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

Files:

• Base/TreeNode.cs (modified) (2 diffs)
• MonteCarloTreeSearch.cs (modified) (4 diffs)
• MonteCarloTreeSearch_PruneLeaves.cs (modified) (2 diffs)

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

@@ -14 +14 @@
         public string phrase;
         public TreeNode parent;
-        public List<TreeNode> children;
+        public TreeNode[] children;
         public IBanditPolicyActionInfo actionInfo;
-        public int level;
+        public ushort level;
 
-        public TreeNode(TreeNode parent, string phrase, IBanditPolicyActionInfo actionInfo, int level)
+        public TreeNode(TreeNode parent, string phrase, IBanditPolicyActionInfo actionInfo, ushort level)
         {
             this.parent = parent;
@@ -34 +34 @@
             return children.Select(n => n.actionInfo);
         }
+
+        internal void RemoveChildren(TreeNode currentNode)
+        {
+            TreeNode[] newChildren = new TreeNode[children.Length-1];
+            int counter = 0;
+            for (int i = 0; i < children.Length; i++)
+            {
+                if (children[i] != currentNode)
+                {
+                    newChildren[counter] = children[i];
+                    counter++;
+                }
+            }
+            children = newChildren;
+        }
     }
 }

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

@@ -120 +120 @@
             if (treeNode.children == null)
             {
-                treeNode.children = new List<TreeNode>();
+                List<TreeNode> newChildren = new List<TreeNode>();
 
                 var phrase = new Sequence(treeNode.phrase);
@@ -137 +137 @@
                             {
                                 childNode = new TreeNode(treeNode, newSequence.ToString(),
-                                    behaviourPolicy.CreateActionInfo(), treeNode.level + 1);
-                                treeNode.children.Add(childNode);
+                                    behaviourPolicy.CreateActionInfo(), (ushort) (treeNode.level + 1));
+                                newChildren.Add(childNode);
                             }
                         }
                     }
                 }
+                treeNode.children = newChildren.ToArray();
             }
         }
@@ -164 +165 @@
         }
 
-        private void GetTreeInfosRek(TreeInfos treeInfos, List<TreeNode> children)
-        {
-            treeInfos.TotalNodes += children.Count;
+        private void GetTreeInfosRek(TreeInfos treeInfos, TreeNode[] children)
+        {
+            treeInfos.TotalNodes += children.Length;
             foreach (TreeNode child in children)
             {
@@ -342 +343 @@
             return HexConverter(Color.FromArgb(newR, newG, newB));
         }
+
+        public void FreeAll()
+        {
+            rootNode = null;
+            GC.Collect();
+        }
     }
 }

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

@@ -47 +47 @@
                     {
                         // already removed all child nodes so remove it too..
-                        currentNode.parent.children.Remove(currentNode);
+                        currentNode.parent.RemoveChildren(currentNode);
                         continue;
                     }
@@ -63 +63 @@
                         // Version 2:
                         // remove currentNode from tree..
-                        currentNode.parent.children.Remove(currentNode);
+                        currentNode.parent.RemoveChildren(currentNode);
                     }
                 }