- Timestamp:
- 01/30/14 08:53:39 (11 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/HeuristicLab.Problems.GPDL/CodeGenerator/MonteCarloTreeSearchCodeGen.cs
r10427 r10430 46 46 } 47 47 48 private const int RANDOM_TRIES = 1 ;48 private const int RANDOM_TRIES = 100; 49 49 50 50 private void SampleTree(SearchTreeNode searchTree, Stack<Tuple<Tree, int, int, int>> extensionPoints) { … … 155 155 Debug.Assert(parent.tries >= n.tries); 156 156 Debug.Assert(n.tries > 0); 157 return n.sumQuality / n.tries + Math.Sqrt((40 * Math.Log(parent.tries)) / n.tries ); // constant is dependent fitness function values157 return n.sumQuality / n.tries + Math.Sqrt((400 * Math.Log(parent.tries)) / n.tries ); // constant is dependent fitness function values 158 158 } 159 159
Note: See TracChangeset
for help on using the changeset viewer.