pypi i Axelrod


Reproduce the Axelrod iterated prisoners dilemma tournament

by Vince Knight, Owen Campbell, Karol Langner, Marc Harper

4.12.0 (see all)License:The MIT License (MIT)
pypi i Axelrod

.. image:: :target:

.. image:: :target:

.. image:: :target:

|Join the chat at|



A Python library with the following principles and goals:

  1. Enabling the reproduction of previous Iterated Prisoner's Dilemma research as easily as possible.
  2. Creating the de-facto tool for future Iterated Prisoner's Dilemma research.
  3. Providing as simple a means as possible for anyone to define and contribute new and original Iterated Prisoner's Dilemma strategies.
  4. Emphasizing readability along with an open and welcoming community that is accommodating for developers and researchers of a variety of skill levels.


With Axelrod you:

  • have access to over 200 strategies <>_, including original and classics like Tit For Tat and Win Stay Lose Shift. These are extendable through parametrization and a collection of strategy transformers.

  • can create head to head matches <>_ between pairs of strategies.

  • can create tournaments <>_ over a number of strategies.

  • can study population dynamics through Moran processes <> and an infinite population model <>.

  • can analyse detailed results of tournaments <>_ and matches.

  • can visualise results <>_ of tournaments.

    .. image:: :height: 300 px :align: center

  • can reproduce a number of contemporary research topics such as fingerprinting <> of strategies and morality metrics <>.

    .. image:: :height: 300 px :align: center

The library has 100% test coverage and is extensively documented. See the documentation for details and examples of all the features:

An open reproducible framework for the study of the iterated prisoner's dilemma <>_: a peer reviewed paper introducing the library (22 authors).


The library requires Python 3.6 or greater.

The simplest way to install is::

$ pip install axelrod

To install from source::

$ git clone
$ cd Axelrod
$ python install

Quick Start

The following runs a basic tournament::

>>> import axelrod as axl
>>> players = [s() for s in axl.demo_strategies]  # Create players
>>> tournament = axl.Tournament(players, seed=1)  # Create a tournament
>>> results =  # Play the tournament
>>> results.ranked_names
['Defector', 'Grudger', 'Tit For Tat', 'Cooperator', 'Random: 0.5']



All contributions are welcome!

You can find helpful instructions about contributing in the documentation:


You can find a list of publications that make use of or cite the library on the citations <>_ page.


The library has had many awesome contributions from many great contributors <>_. The Core developers of the project are:

  • drvinceknight <>_
  • gaffney2010 <>_
  • marcharper <>_
  • meatballs <>_
  • nikoleta-v3 <>_

.. |Join the chat at| image:: :target: