Minor styling changes

Author: gaffney2010

axelrod/strategies/axelrod_second.py

@@ -203,6 +203,7 @@ def strategy(self, opponent: Player) -> Action:
             # Play TFT
             return opponent.history[-1]
 
+
 class Tranquilizer(Player):
 
     """
@@ -468,6 +469,7 @@ def strategy(self, opponent: Player) -> Action:
                 return C
             return D
 
+
 class Kluepfel(Player):
     """
     Strategy submitted to Axelrod's second tournament by Charles Kluepfel
@@ -549,7 +551,7 @@ def strategy(self, opponent: Player) -> Action:
 
         if one_move_ago == two_moves_ago and two_moves_ago == three_moves_ago:
             return one_move_ago
-        
+
         r = random.random() # Everything following is stochastic
         if one_move_ago == two_moves_ago:
             if r < 0.9:
@@ -567,6 +569,7 @@ def strategy(self, opponent: Player) -> Action:
             else:
                 return one_move_ago.flip()
 
+
 class Borufsen(Player):
     """
     Strategy submitted to Axelrod's second tournament by Otto Borufsen
@@ -588,8 +591,8 @@ class Borufsen(Player):
        cooperate.  (Doesn't block third rule.)
     3. Otherwise, do tit-for-tat.
 
-    Start in normal mode, but every 25 turns starting with the 27th turn, 
-    re-evaluate the mode.  Enter defect mode if any of the following 
+    Start in normal mode, but every 25 turns starting with the 27th turn,
+    re-evaluate the mode.  Enter defect mode if any of the following
     conditions hold:
 
     - Detected random:  Opponent cooperated 7-18 times since last mode 
@@ -689,7 +692,7 @@ def strategy(self, opponent: Player) -> Action:
             return D
         else:
             assert self.mode == "Normal"
-            
+
             # Look for mutual defects
             if self.history[-1] == D and opponent.history[-1] == D:
                 self.mutual_defect_streak += 1
@@ -699,7 +702,7 @@ def strategy(self, opponent: Player) -> Action:
                 self.mutual_defect_streak = 0
                 self.echo_streak = 0 # Reset both streaks.
                 return self.try_return(C)
-            
+
             # Look for echoes
             # Fortran code defaults two turns back to C if only second turn
             my_two_back, opp_two_back = C, C
@@ -719,6 +722,7 @@ def strategy(self, opponent: Player) -> Action:
             # Tit-for-tat
             return self.try_return(opponent.history[-1])
 
+
 class Cave(Player):
     """
     Strategy submitted to Axelrod's second tournament by Rob Cave (K49R), and
@@ -756,13 +760,15 @@ def strategy(self, opponent: Player) -> Action:
         if turn == 1: return C
 
         number_defects = opponent.defections
-        # Size of numerator is smaller than denomator -- How it was in the Fortran.
         perc_defects = number_defects / turn
 
         # If overly defect or appears random
-        if turn > 39 and perc_defects > 0.39: return D
-        if turn > 29 and perc_defects > 0.65: return D
-        if turn > 19 and perc_defects > 0.79: return D
+        if turn > 39 and perc_defects > 0.39:
+            return D
+        if turn > 29 and perc_defects > 0.65:
+            return D
+        if turn > 19 and perc_defects > 0.79:
+            return D
 
         if opponent.history[-1] == D:
             if number_defects > 17:
@@ -772,6 +778,7 @@ def strategy(self, opponent: Player) -> Action:
         else:
             return C
 
+
 class WmAdams(Player):
     """
     Strategy submitted to Axelrod's second tournament by William Adams (K44R),
@@ -854,10 +861,12 @@ def update_score(self, opponent: Player):
         self.own_score += game.score(last_round)[0]
 
     def strategy(self, opponent: Player) -> Action:
-        if self.mode == "Defect": return D
+        if self.mode == "Defect":
+            return D
 
         turn = len(self.history) + 1
-        if turn == 1: return C
+        if turn == 1:
+            return C
 
         self.update_score(opponent)