Skip to content

Update README #829

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jan 27, 2017
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 17 additions & 4 deletions README.rst
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
Axelrod
=======

A library with the following principles and goals:
A python library with the following principles and goals:
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Python should capitalized, no?


1. Enabling the reproduction of previous Iterated Prisoner's Dilemma research
as easily as possible.
Expand All @@ -26,10 +26,23 @@ A library with the following principles and goals:
4. Emphasizing readability along with an open and welcoming community that
is accommodating for developers and researchers of a variety of skill levels.

Currently the library contains well over 100 strategies and can perform a
Currently the library contains well over 150 strategies including classics
such as Tit-For-Tat (TFT) and Win-Stay-Lose-Shift (WSLS), recent variants
including zero-determinant strategies, and a variety of novel strategies
including several machine-learning based strategies. Many strategies
are parameterized, allowing for infinitely-many variations. We welcome
new strategies and additions from the literature: see [here](https://github.com/Axelrod-Python/Axelrod/issues/379)
for a list of known strategies and sources.

With these strategies the library and can perform head-to-head Matches, a
variety of tournament types (RoundRobin, Noisy, Spatially-distributed, and
probabilistically ending) and population dynamics while taking advantage
of multi-core processors.
probabilistically ending) and population dynamics including the Moran process
on graphs, while taking advantage of multi-core processors.

The library emphasizes reproducibility and validity. The current test suite
covers more than 99% of all code in the library, with many portions
covered many times over, including [randomly generated tests](https://github.com/HypothesisWorks/hypothesis-python)
that are created and run regularly.

**Please contribute via pull request (or just get in touch with us).**

Expand Down