Skip to content

Commit 865b083

Browse files
committed
Improve formatting of the docstring when sphinx'd
This is what it looks like on master: https://www.dropbox.com/s/9vsr067ag67c445/Screenshot%202016-08-07%2010.07.15.png?dl=0 This is what it looks like with this commit: https://www.dropbox.com/s/xr9ilbp6xeg0t7u/Screenshot%202016-08-07%2010.05.56.png?dl=0
1 parent 27128ea commit 865b083

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

axelrod/strategies/lookerup.py

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -20,18 +20,18 @@ class LookerUp(Player):
2020
* my last action was a C the opponents
2121
* last action was a D
2222
23-
then the corresponding key would be
23+
then the corresponding key would be::
2424
2525
('C', 'C', 'D')
2626
2727
and the value would contain the action to play on this turn.
2828
2929
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::
3131
3232
{('', '', '') : C}
3333
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::
3535
3636
{('', 'C', 'D'): D,
3737
('', 'D', 'D'): D,
@@ -42,7 +42,7 @@ class LookerUp(Player):
4242
4343
Lookup tables where the action depends on the opponent's first actions (as
4444
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::
4646
4747
{('C', 'C', 'C'): C,
4848
('D', 'C', 'C'): D}
@@ -53,7 +53,7 @@ class LookerUp(Player):
5353
5454
To denote lookup tables where the action depends on sequences of actions
5555
(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::
5757
5858
{('CC', 'CDD', 'CCC'): C,
5959
('CD', 'CCD', 'CCC'): D}

0 commit comments

Comments
 (0)