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