Attempt to cover remaining lines with larger mutation probabilities

Author: marcharper

axelrod/strategies/hmm.py

@@ -24,9 +24,6 @@ def is_stochastic_matrix(m, ep=1e-8) -> bool:
 
 def normalize_vector(vec):
     s = sum(vec)
-    # if s == 0.0:
-    #     n = len(vec)
-    #     return [1. / n for v in vec]
     vec = [v / s for v in vec]
     return vec
 

axelrod/strategies/lookerup.py

@@ -492,7 +492,7 @@ def mutate(self):
         initial_actions = list(self.initial_actions)
         for i in range(len(initial_actions)):
             r = random.random()
-            if r < 0.05:
+            if r < self.mutation_probability:
                 initial_actions[i] = initial_actions[i].flip()
         return self.create_new(
             lookup_dict=lookup_dict,

axelrod/tests/strategies/test_evolvable_player.py

@@ -93,8 +93,8 @@ def test_mutate_variations(self):
             return
         seed(100)
         variants_produced = False
-        for _ in range(2, 2000):
-            player = self.player()
+        for _ in range(2, 400):
+            player = self.player(mutation_probability=1)
             mutant = player.clone().mutate()
             if player != mutant:
                 variants_produced = True