|
5 | 5 |
|
6 | 6 | using namespace tuo; |
7 | 7 |
|
8 | | -inline unsigned skipped_simulations_increment(Process& proc, unsigned num_iterations) |
9 | | -{ |
10 | | - if (num_iterations == 0 || !use_db_load) |
11 | | - { |
12 | | - return num_iterations; |
13 | | - } |
14 | | - std::vector<std::array<std::string, 3>> const vhashes = proc.hashes(); |
15 | | - EvaluatedResults db_results{EvaluatedResults::first_type(vhashes.size()), 0}; |
16 | | - if (!proc.check_db(vhashes, num_iterations, db_results)) |
17 | | - { |
18 | | - return 0; |
19 | | - } |
20 | | - return num_iterations; |
21 | | -} |
22 | | - |
23 | 8 | inline bool try_improve_deck(Deck* d1, unsigned from_slot, unsigned to_slot, const Card* card_candidate, |
24 | 9 | const Card*& best_commander, const Card*& best_alpha_dominion, std::vector<const Card*>& best_cards, |
25 | 10 | FinalResults<long double>& best_score, unsigned& best_gap, std::string& best_deck, |
@@ -58,7 +43,7 @@ inline bool try_improve_deck(Deck* d1, unsigned from_slot, unsigned to_slot, con |
58 | 43 | auto & prev_results = emplace_rv.first->second; |
59 | 44 | if (!emplace_rv.second) |
60 | 45 | { |
61 | | - skipped_simulations += skipped_simulations_increment(proc, prev_results.second); |
| 46 | + skipped_simulations += prev_results.second; |
62 | 47 | } |
63 | 48 |
|
64 | 49 | // Evaluate new deck |
@@ -100,7 +85,7 @@ inline FinalResults<long double> fitness(Deck* d1, |
100 | 85 | auto & prev_results = emplace_rv.first->second; |
101 | 86 | if (!emplace_rv.second) |
102 | 87 | { |
103 | | - skipped_simulations += skipped_simulations_increment(proc, prev_results.second); |
| 88 | + skipped_simulations += prev_results.second; |
104 | 89 | } |
105 | 90 |
|
106 | 91 | // Evaluate new deck |
@@ -235,7 +220,7 @@ DeckResults hill_climbing(unsigned num_min_iterations, unsigned num_iterations, |
235 | 220 | if (best_score.n_sims >= num_iterations || best_gap > 0) |
236 | 221 | { break; } // exit main climbing loop |
237 | 222 | auto & prev_results = evaluated_decks[best_deck]; |
238 | | - skipped_simulations += skipped_simulations_increment(proc, prev_results.second); |
| 223 | + skipped_simulations += prev_results.second; |
239 | 224 | // Re-evaluate the best deck |
240 | 225 | d1->commander = best_commander; |
241 | 226 | d1->alpha_dominion = best_alpha_dominion; |
@@ -907,7 +892,7 @@ void recursion(unsigned num_iterations, std::vector<unsigned> used, unsigned poo |
907 | 892 | auto & prev_results = emplace_rv.first->second; |
908 | 893 | if(!emplace_rv.second) |
909 | 894 | { |
910 | | - skipped_simulations += skipped_simulations_increment(proc, prev_results.second); |
| 895 | + skipped_simulations += prev_results.second; |
911 | 896 | } |
912 | 897 | auto compare_results= proc.evaluate(num_iterations, prev_results); |
913 | 898 | auto current_score = compute_score(compare_results, proc.factors); |
|
0 commit comments