Skip to content

Commit 51e7523

Browse files
committed
Conflicts: axelrod/strategies/axelrod_second.py
2 parents beab229 + bc9cd5a commit 51e7523

File tree

2 files changed

+5
-3
lines changed

2 files changed

+5
-3
lines changed

README.rst

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -123,8 +123,8 @@ http://axelrod.readthedocs.org/en/latest/tutorials/contributing/index.html
123123
Publications
124124
------------
125125

126-
* Marc Harper, Vincent Knight, Martin Jones, Georgios Koutsovoulos, Nikoleta E. Glynatsi, Owen Campbell. `Reinforcement learning produces dominant strategies for the Iterated Prisoner’s Dilemma. <http://journals.plos.org/plosone/article/metrics?id=10.1371/journal.pone.0188046>`_. Plos One (2017). (`ArXiv Preprint <https://arxiv.org/abs/1707.06307>`_)
127-
* Knight, Vincent, Owen Campbell, Marc Harper, Karol Langner et al. `An Open Framework for the Reproducible Study of the Iterated Prisoner’s Dilemma. <https://openresearchsoftware.metajnl.com/articles/10.5334/jors.125/>`_ Journal of Open Research Software 4, no. 1 (2016). (`ArXiv Preprint <https://arxiv.org/abs/1604.00896>`_)
126+
* Marc Harper, Vincent Knight, Martin Jones, Georgios Koutsovoulos, Nikoleta E. Glynatsi, Owen Campbell. `Reinforcement learning produces dominant strategies for the Iterated Prisoner’s Dilemma. <http://journals.plos.org/plosone/article/metrics?id=10.1371/journal.pone.0188046>`_ Plos One (2017). (`ArXiv Preprint <https://arxiv.org/abs/1707.06307>`_)
127+
* Vincent Knight, Owen Campbell, Marc Harper, Karol Langner et al. `An Open Framework for the Reproducible Study of the Iterated Prisoner’s Dilemma. <https://openresearchsoftware.metajnl.com/articles/10.5334/jors.125/>`_ Journal of Open Research Software 4, no. 1 (2016). (`ArXiv Preprint <https://arxiv.org/abs/1604.00896>`_)
128128

129129

130130
Contributors

axelrod/strategies/axelrod_second.py

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1505,7 +1505,9 @@ def strategy(self, opponent: Player) -> Action:
15051505
if len(opponent.history) >= go_back:
15061506
recent_history[-go_back] = opponent.history[-go_back]
15071507

1508-
return random_choice(self.prob_coop[tuple(recent_history)])
1508+
return random_choice(self.prob_coop[(recent_history[-3],
1509+
recent_history[-2],
1510+
recent_history[-1])])
15091511

15101512

15111513
class White(Player):

0 commit comments

Comments
 (0)