Skip to content

Commit d124479

Browse files
committed
[#696] Correct continutation marks
1 parent 8a50a74 commit d124479

File tree

1 file changed

+26
-27
lines changed

1 file changed

+26
-27
lines changed

docs/tutorials/advanced/classification_of_strategies.rst

Lines changed: 26 additions & 27 deletions
Original file line numberDiff line numberDiff line change
@@ -11,14 +11,14 @@ Here is the :code:`classifier` for the :code:`Cooperator` strategy::
1111

1212
>>> import axelrod as axl
1313
>>> expected_dictionary = {
14-
>>> 'manipulates_state': False,
15-
>>> 'makes_use_of': set([]),
16-
>>> 'long_run_time': False,
17-
>>> 'stochastic': False,
18-
>>> 'manipulates_source': False,
19-
>>> 'inspects_source': False,
20-
>>> 'memory_depth': 0
21-
>>> } # Order of this dictionary might be different on your machine
14+
... 'manipulates_state': False,
15+
... 'makes_use_of': set([]),
16+
... 'long_run_time': False,
17+
... 'stochastic': False,
18+
... 'manipulates_source': False,
19+
... 'inspects_source': False,
20+
... 'memory_depth': 0
21+
... } # Order of this dictionary might be different on your machine
2222
>>> axl.Cooperator.classifier == expected_dictionary
2323
True
2424

@@ -34,9 +34,9 @@ filters which we define in a 'filterset' dictionary and then pass to the
3434
strategies::
3535

3636
>>> filterset = {
37-
>>> 'stochastic': True
38-
>>> }
39-
>>> strategies = filtered_strategies(filterset)
37+
... 'stochastic': True
38+
... }
39+
>>> strategies = axl.filtered_strategies(filterset)
4040
>>> len(strategies)
4141
43
4242

@@ -45,9 +45,9 @@ Or, to find out how many strategy only use 1 turn worth of memory to
4545
make a decision::
4646

4747
>>> filterset = {
48-
>>> 'memory_depth': 1
49-
>>> }
50-
>>> strategies = filtered_strategies(filterset)
48+
... 'memory_depth': 1
49+
... }
50+
>>> strategies = axl.filtered_strategies(filterset)
5151
>>> len(strategies)
5252
24
5353

@@ -56,10 +56,10 @@ range of memory_depth values, we can use the 'min_memory_depth' and
5656
'max_memory_depth' filters::
5757

5858
>>> filterset = {
59-
>>> 'min_memory_depth': 1,
60-
>>> 'max_memory_depth': 4
61-
>>> }
62-
>>> strategies = filtered_strategies(filterset)
59+
... 'min_memory_depth': 1,
60+
... 'max_memory_depth': 4
61+
... }
62+
>>> strategies = axl.filtered_strategies(filterset)
6363
>>> len(strategies)
6464
24
6565

@@ -68,9 +68,9 @@ tournament. For example, here is the number of strategies that make use of the
6868
length of each match of the tournament::
6969

7070
>>> filterset = {
71-
>>> 'makes_use_of': ['length']
72-
>>> }
73-
>>> strategies = filtered_strategies(filterset)
71+
... 'makes_use_of': ['length']
72+
... }
73+
>>> strategies = axl.filtered_strategies(filterset)
7474
>>> len(strategies)
7575
10
7676

@@ -79,18 +79,17 @@ must be a list. Here is how we might identify the number of strategies that use
7979
both the length of the tournament and the game being played::
8080

8181
>>> filterset = {
82-
>>> 'makes_use_of': ['length', 'game']
83-
>>> }
84-
>>> strategies = filtered_strategies(filterset)
82+
... 'makes_use_of': ['length', 'game']
83+
... }
84+
>>> strategies = axl.filtered_strategies(filterset)
8585
>>> len(strategies)
8686
10
8787

8888
Some strategies have been classified as having a particularly long run time::
8989

9090
>>> filterset = {
91-
>>> 'long_run_time': True
92-
>>> }
93-
>>> strategies = filtered_strategies(filterset)
91+
... 'long_run_time': True
92+
>>> strategies = axl.filtered_strategies(filterset)
9493
>>> len(strategies)
9594
10
9695

0 commit comments

Comments
 (0)