@@ -7,31 +7,40 @@ Welcome to the documentation for the Axelrod Python library
7
7
===========================================================
8
8
9
9
Here is quick overview of the current capabilities of the library:
10
+
10
11
* Over 100 strategies from the literature and some exciting original
11
- contributions
12
+ contributions
13
+
12
14
* Classic strategies like TiT-For-Tat, WSLS, and variants
13
15
* Zero-Determinant and other Memory-One strategies
14
16
* Many generic strategies that can be used to define an array of popular
15
- strategies, including finite state machines, strategies that hunt for
16
- patterns in other strategies, and strategies that combine the effects of
17
- many others
17
+ strategies, including finite state machines, strategies that hunt for
18
+ patterns in other strategies, and strategies that combine the effects of
19
+ many others
18
20
* Strategy transformers that augment that abilities of any strategy
21
+
19
22
* Head-to-Head matches
23
+
20
24
* Round Robin tournaments with a variety of options, including:
25
+
21
26
* noisy environments
22
27
* spatial games
23
28
* probabilistically chosen match lengths
29
+
24
30
* Population dynamics
31
+
25
32
* The Moran process
26
33
* An ecological model
27
- *Multi-processor support, caching for deterministic interactions, automatically
28
- generate figures and statistics
34
+
35
+ * Multi-processor support, caching for deterministic interactions, automatically
36
+ generate figures and statistics
29
37
30
38
Every strategy is categorized on a number of dimensions, including:
39
+
31
40
* Deterministic or Stochastic
32
41
* How many rounds of history used
33
42
* Whether the strategy has access to the game matrix, the length of the
34
- match, etc.
43
+ match, etc.
35
44
36
45
Furthermore the library is extensively tested with 99%+ coverage, ensuring
37
46
validity and reproducibility of results!
0 commit comments