Marc

I don't know -- I haven't taken the time to translate the Fortran code and we don't know what the analogy strategy is in any case. Probably one or more...

The FORTRAN is below. It looks like at some point (near the end) the strategy computes `N = RANDO * 10.0 + 5.0` and counts down to `N=0` at which...

My guess is that one of the following is happening: * they are the same and that the description above comes from a summary (one of the books about Axelrod's...

Welcome back! Open the PR on this repository, please. For the stochastic tests please set random seeds for reproducibility. If you have trouble finding suitable seeds try looping the test...

More suggestions: * is_human_designed vs is_trained * is_published_tournament_winner * is_axelrod_first * is_axelrod_second

Let's make sure to maintain a "5.0" changelog as we go. Just something simple that explains, for each 5.0 PR, the changes made.

Hi all, quick update on this one. There are really four possibly strategies here depending on how one wants to update the underlying parameters each round. It's also not clear...

https://github.com/danilobellini/notebooks/blob/master/2018-11-10_Axelrod/2018-11-10_Axelrod.ipynb

Great. I hacked out an early version to help me find seeds for #1288 by watching all the invocations of `versus_test`. It's not perfect because if a subtest fails, the...

I'd like to do the same thing for full tournaments and Moran processes.