Skip to content
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

Docs fix #1291

Merged
merged 2 commits into from
Mar 13, 2020
Merged
Changes from all commits
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
4 changes: 2 additions & 2 deletions docs/reference/overview_of_strategies.rst
Original file line number Diff line number Diff line change
Expand Up @@ -165,7 +165,7 @@ ALLC, ALLD, TFT and RANDOM are defined above. The remaining classical
strategies are defined below. The tournament also included two Zero Determinant
strategies, both implemented in the library. The full table of strategies and
results is `available
online <http://www.pnas.org/content/109/26/10134/F1.expansion.html>`_.
online <https://www.pnas.org/content/pnas/109/26/10134/F1.large.jpg?width=800&height=600&carousel=1>`_.

Memory one strategies
^^^^^^^^^^^^^^^^^^^^^
Expand Down Expand Up @@ -301,7 +301,7 @@ HARD_TFT
^^^^^^^^

Hard TFT is not defined in [Stewart2012]_ but is
`[elsewhere] <http://www.prisoners-dilemma.com/strategies.html>`_
`elsewhere <http://www.prisoners-dilemma.com/strategies.html>`_
defined as follows. The strategy cooperates on the
first move, defects if the opponent has defected on any of the previous three
rounds, and otherwise cooperates.
Expand Down