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

Timestamp:

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

Author:

aballeit

Message:

#2283 limit parallelism

File:

• branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch.cs (modified) (4 diffs)

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