diff --git a/src/apex/exhaustive.cpp b/src/apex/exhaustive.cpp index 048cf36f..c118626d 100644 --- a/src/apex/exhaustive.cpp +++ b/src/apex/exhaustive.cpp @@ -67,7 +67,8 @@ void Exhaustive::evaluate(double new_cost) { if (new_cost < cost) { if (new_cost < best_cost) { best_cost = new_cost; - std::cout << "New best! " << new_cost << " k: " << k; + std::cout << "New best! " << new_cost << " k: " << k + << " kmax: " << kmax; for (auto& v : vars) { v.second.save_best(); } for (auto& v : vars) { std::cout << ", " << v.first << ": " << v.second.toString(); } std::cout << std::endl; diff --git a/src/apex/genetic_search.cpp b/src/apex/genetic_search.cpp index 04d312e8..5c581cac 100644 --- a/src/apex/genetic_search.cpp +++ b/src/apex/genetic_search.cpp @@ -167,7 +167,8 @@ void GeneticSearch::evaluate(double new_cost) { if (new_cost < cost) { if (new_cost < best_cost) { best_cost = new_cost; - std::cout << "New best! " << new_cost << " k: " << k; + std::cout << "New best! " << new_cost << " k: " << k + << " kmax: " << kmax; for (auto& v : vars) { v.second.save_best(); } for (auto& v : vars) { std::cout << ", " << v.first << ": " << v.second.toString(); } std::cout << std::endl; diff --git a/src/apex/random.cpp b/src/apex/random.cpp index 7bd271db..6a1274d2 100644 --- a/src/apex/random.cpp +++ b/src/apex/random.cpp @@ -68,7 +68,8 @@ void Random::evaluate(double new_cost) { if (new_cost < cost) { if (new_cost < best_cost) { best_cost = new_cost; - std::cout << "New best! " << new_cost << " k: " << k; + std::cout << "New best! " << new_cost << " k: " << k + << " kmax: " << kmax; for (auto& v : vars) { v.second.save_best(); } for (auto& v : vars) { std::cout << ", " << v.first << ": " << v.second.toString(); } std::cout << std::endl; diff --git a/src/apex/simulated_annealing.cpp b/src/apex/simulated_annealing.cpp index 79e544d5..994d4085 100644 --- a/src/apex/simulated_annealing.cpp +++ b/src/apex/simulated_annealing.cpp @@ -58,7 +58,8 @@ void SimulatedAnnealing::evaluate(double new_cost) { for (auto& v : vars) { v.second.choose_neighbor(); } if (new_cost < best_cost) { best_cost = new_cost; - std::cout << "New best! " << new_cost << " k: " << k << " temp: " << temp; + std::cout << "New best! " << new_cost << " k: " << k + << " kmax: " << kmax << " temp: " << temp; for (auto& v : vars) { v.second.save_best(); } for (auto& v : vars) { std::cout << ", " << v.first << ": " << v.second.toString(); } std::cout << std::endl;