@@ -20,18 +20,18 @@ class LookerUp(Player):
20
20
* my last action was a C the opponents
21
21
* last action was a D
22
22
23
- then the corresponding key would be
23
+ then the corresponding key would be::
24
24
25
25
('C', 'C', 'D')
26
26
27
27
and the value would contain the action to play on this turn.
28
28
29
29
Some well-known strategies can be expressed as special cases; for example
30
- Cooperator is given by the dict:
30
+ Cooperator is given by the dict::
31
31
32
32
{('', '', '') : C}
33
33
34
- where m and n are both zero. Tit-For-Tat is given by:
34
+ where m and n are both zero. Tit-For-Tat is given by::
35
35
36
36
{('', 'C', 'D'): D,
37
37
('', 'D', 'D'): D,
@@ -42,7 +42,7 @@ class LookerUp(Player):
42
42
43
43
Lookup tables where the action depends on the opponent's first actions (as
44
44
opposed to most recent actions) will have a non-empty first string in the
45
- tuple. For example, this fragment of a dict:
45
+ tuple. For example, this fragment of a dict::
46
46
47
47
{('C', 'C', 'C'): C,
48
48
('D', 'C', 'C'): D}
@@ -53,7 +53,7 @@ class LookerUp(Player):
53
53
54
54
To denote lookup tables where the action depends on sequences of actions
55
55
(so m or n are greater than 1), simply concatenate the strings together.
56
- Below is an incomplete example where m=3 and n=2.
56
+ Below is an incomplete example where m=3 and n=2::
57
57
58
58
{('CC', 'CDD', 'CCC'): C,
59
59
('CD', 'CCD', 'CCC'): D}
0 commit comments