Changeset 12827
- Timestamp:
- 08/02/15 13:13:25 (9 years ago)
- Location:
- branches/HeuristicLab.Problems.GrammaticalOptimization
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/HeuristicLab.Problems.GrammaticalOptimization/Evaluation/MainWindow.xaml.cs
r12824 r12827 396 396 { 397 397 StringBuilder tableExport = new StringBuilder(); 398 tableExport.Append Line(398 tableExport.Append( 399 399 "Run\tMaxIterations\tEvaluations\tBestKnownQuality\tQuality\tQuality %\tFoundAt\tTotalTime\tSolutionTime\tEvaluationsPerSecond\tSolution"); 400 if (ListViewRuns.Items.Count > 0 && ((Run) ListViewRuns.Items[0]).TreeInfos != null) 401 { 402 tableExport.Append("\tTotalNodes\tUnexpandedNodes\tExpandedNodes\tLeaveNodes\tDeepestLevel"); 403 } 404 tableExport.AppendLine(); 400 405 for (int i = 0; i < ListViewRuns.Items.Count; i++) 401 406 { 402 407 Run run = (Run)ListViewRuns.Items[i]; 403 tableExport.Append Line(string.Format("{0}\t{1}\t{2}\t{3}\t{4}\t{5}\t{6}\t{7}\t{8}\t{9}\t{10}", run.RunNumber,408 tableExport.Append(string.Format("{0}\t{1}\t{2}\t{3}\t{4}\t{5}\t{6}\t{7}\t{8}\t{9}\t{10}", run.RunNumber, 404 409 run.MaxIterations, run.Evaluations, run.BestKnownQuality, run.BestQuality, 405 410 run.BestQuality / run.BestKnownQuality, run.BestSolutionFoundAt, run.TotalTime, run.BestSolutionTime, 406 411 run.EvaluationsPerSecond, run.BestSolution)); 412 413 if (run.TreeInfos != null) 414 { 415 tableExport.Append(string.Format("\t{0}\t{1}\t{2}\t{3}\t{4}", run.TreeInfos.TotalNodes, 416 run.TreeInfos.UnexpandedNodes, run.TreeInfos.ExpandedNodes, run.TreeInfos.LeaveNodes, 417 run.TreeInfos.DeepestLevel)); 418 } 419 420 tableExport.AppendLine(); 407 421 } 408 422 Clipboard.SetData(DataFormats.Text, tableExport.ToString()); -
branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.GeneticProgramming/StandardGP.cs
r12815 r12827 31 31 TournamentGroupSize = 4; 32 32 MutationRate = 0.15; 33 MaxSolutionSize = 30;33 MaxSolutionSize = 40; 34 34 MaxSolutionDepth = 17; 35 35 this.saveAlg = saveAlg; -
branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch.cs
r12815 r12827 97 97 currentNode.GetChildActionInfos()); 98 98 currentNode = currentNode.children[currentActionIndex]; 99 selections++;100 CheckSelection(currentNode, selections);99 //selections++; 100 //CheckSelection(currentNode, selections); 101 101 } 102 102 … … 109 109 currentNode.children[behaviourPolicy.SelectAction(random, currentNode.GetChildActionInfos()) 110 110 ]; 111 selections++;112 CheckSelection(currentNode, selections);111 //selections++; 112 //CheckSelection(currentNode, selections); 113 113 } 114 114 if (currentNode.phrase.Length <= maxLen) -
branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/MonteCarloTreeSearch_PruneLeaves.cs
r12815 r12827 38 38 currentNode.GetChildActionInfos()); 39 39 currentNode = currentNode.children[currentActionIndex]; 40 selections++;41 CheckSelection(currentNode, selections);40 //selections++; 41 //CheckSelection(currentNode, selections); 42 42 } 43 43 … … 59 59 currentNode.children[behaviourPolicy.SelectAction(random, currentNode.GetChildActionInfos()) 60 60 ]; 61 selections++;62 CheckSelection(currentNode, selections);61 //selections++; 62 //CheckSelection(currentNode, selections); 63 63 } 64 64 else
Note: See TracChangeset
for help on using the changeset viewer.