Skip to content

Commit 5fbc6de

Browse files
MariosZouliasmarcharper
authored andcommitted
Refactoring mutual.py using versus_test
1 parent d7c93ce commit 5fbc6de

File tree

1 file changed

+92
-9
lines changed

1 file changed

+92
-9
lines changed

axelrod/tests/strategies/test_mutual.py

Lines changed: 92 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -22,10 +22,37 @@ class TestDesperate(TestPlayer):
2222
def test_strategy(self):
2323
self.first_play_test(C, seed=1)
2424
self.first_play_test(D, seed=2)
25-
self.responses_test([D], [C] * 4, [D] * 4)
26-
self.responses_test([D], [D, D, C], [C, C, D])
27-
self.responses_test([C], [D, D, D], [C, C, D])
2825

26+
#Our Player (Desperate) vs Cooperator SEED -->1
27+
opponent = axelrod.Cooperator()
28+
opponent_actions = [C] * 5
29+
actions = [(C, C), (D, C), (D, C), (D, C), (D,C)]
30+
self.versus_test(opponent, expected_actions=actions, seed=1)
31+
32+
#Our Player (Desperate) vs Cooperator SEED -->2
33+
opponent = axelrod.Cooperator()
34+
actions = [(D, C), (D, C), (D, C), (D, C), (D,C)]
35+
self.versus_test(opponent, expected_actions=actions, seed=2)
36+
37+
#Our Player (Desperate) vs Defector SEED -->1
38+
opponent = axelrod.Defector()
39+
actions = [(C, D), (D, D), (C, D), (D, D), (C,D)]
40+
self.versus_test(opponent, expected_actions=actions, seed=1)
41+
42+
#Our Player (Desperate) vs Defector SEED -->2
43+
opponent = axelrod.Defector()
44+
actions = [(D, D), (C, D), (D, D), (C, D), (D,D)]
45+
self.versus_test(opponent, expected_actions=actions, seed=2)
46+
47+
#Our Player (Desperate) vs Alternator SEED -->1
48+
opponent = axelrod.Alternator()
49+
actions = [(C, C), (D, D), (C, C), (D, D), (C,C)]
50+
self.versus_test(opponent, expected_actions=actions, seed=1)
51+
52+
#Our Player (Desperate) vs Alternator SEED -->2
53+
opponent = axelrod.Alternator()
54+
actions = [(D, C), (D, D), (C, C), (D, D), (C,C)]
55+
self.versus_test(opponent, expected_actions=actions, seed=2)
2956

3057
class TestHopeless(TestPlayer):
3158

@@ -44,9 +71,37 @@ class TestHopeless(TestPlayer):
4471
def test_strategy(self):
4572
self.first_play_test(C, seed=1)
4673
self.first_play_test(D, seed=2)
47-
self.responses_test([C], [C] * 4, [D] * 4)
48-
self.responses_test([C], [D] * 5, [C] * 5)
49-
self.responses_test([D], [C, D, C], [C, C, C])
74+
75+
#Our Player (Hopeless) vs Cooperator SEED -->1
76+
opponent = axelrod.Cooperator()
77+
opponent_actions = [C] * 5
78+
actions = [(C, C), (D, C), (C, C), (D, C), (C,C)]
79+
self.versus_test(opponent, expected_actions=actions, seed=1)
80+
81+
#Our Player (Hopeless) vs Cooperator SEED -->2
82+
opponent = axelrod.Cooperator()
83+
actions = [(D, C), (C, C), (D, C), (C, C), (D,C)]
84+
self.versus_test(opponent, expected_actions=actions, seed=2)
85+
86+
#Our Player (Hopeless) vs Defector SEED -->1
87+
opponent = axelrod.Defector()
88+
actions = [(C, D), (C, D), (C, D), (C, D), (C,D)]
89+
self.versus_test(opponent, expected_actions=actions, seed=1)
90+
91+
#Our Player (Hopeless) vs Defector SEED -->2
92+
opponent = axelrod.Defector()
93+
actions = [(D, D), (C, D), (C, D), (C, D), (C,D)]
94+
self.versus_test(opponent, expected_actions=actions, seed=2)
95+
96+
#Our Player (Hopeless) vs Alternator SEED -->1
97+
opponent = axelrod.Alternator()
98+
actions = [(C, C), (D, D), (C, C), (D, D), (C,C)]
99+
self.versus_test(opponent, expected_actions=actions, seed=1)
100+
101+
#Our Player (Hopeless) vs Alternator SEED -->2
102+
opponent = axelrod.Alternator()
103+
actions = [(D, C), (C, D), (C, C), (D, D), (C,C)]
104+
self.versus_test(opponent, expected_actions=actions, seed=2)
50105

51106

52107
class TestWilling(TestPlayer):
@@ -66,6 +121,34 @@ class TestWilling(TestPlayer):
66121
def test_strategy(self):
67122
self.first_play_test(C, seed=1)
68123
self.first_play_test(D, seed=2)
69-
self.responses_test([C], [C] * 4, [D] * 4)
70-
self.responses_test([C], [D] * 5, [C] * 5)
71-
self.responses_test([D], [C, C, D], [C, C, D])
124+
125+
#Our Player (Willing) vs Cooperator SEED -->1
126+
opponent = axelrod.Cooperator()
127+
opponent_actions = [C] * 5
128+
actions = [(C, C), (C, C), (C, C), (C, C), (C,C)]
129+
self.versus_test(opponent, expected_actions=actions, seed=1)
130+
131+
#Our Player (Willing) vs Cooperator SEED -->2
132+
opponent = axelrod.Cooperator()
133+
actions = [(D, C), (C, C), (C, C), (C, C), (C,C)]
134+
self.versus_test(opponent, expected_actions=actions, seed=2)
135+
136+
#Our Player (Willing) vs Defector SEED -->1
137+
opponent = axelrod.Defector()
138+
actions = [(C, D), (C, D), (C, D), (C, D), (C,D)]
139+
self.versus_test(opponent, expected_actions=actions, seed=1)
140+
141+
#Our Player (Willing) vs Defector SEED -->2
142+
opponent = axelrod.Defector()
143+
actions = [(D, D), (D, D), (D, D), (D, D), (D,D)]
144+
self.versus_test(opponent, expected_actions=actions, seed=2)
145+
146+
#Our Player (Willing) vs Alternator SEED -->1
147+
opponent = axelrod.Alternator()
148+
actions = [(C, C), (C, D), (C, C), (C, D), (C,C)]
149+
self.versus_test(opponent, expected_actions=actions, seed=1)
150+
151+
#Our Player (Willing) vs Alternator SEED -->2
152+
opponent = axelrod.Alternator()
153+
actions = [(D, C), (C, D), (C, C), (C, D), (C,C)]
154+
self.versus_test(opponent, expected_actions=actions, seed=2)

0 commit comments

Comments
 (0)