-
Notifications
You must be signed in to change notification settings - Fork 264
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
K76R Strategy #1102
Comments
Following a good discussion on this I agree with @meatballs. Note that the textual description mentions "not counting the first defection" to ensure that the ratio "remains" below 0.5. We are in agreement that this is equivalent to simply counting the total number of moves to ensure that the current ratio is below 0.5. 👍 |
I would like to work on this but there is a strategy in axelrod_second.py already called "Tester". It is somewhat different than the description given here so i'm not sure if I should modify it or just make a new class. |
That's great @dmanc! I suggest the class name for this strategy be |
Just to make sure, these two statements are equivalent right? |
After much debate, yes, we think they are equivalent. The second statement is a direct description of what the fortran code actually does. |
Closed by #1110 |
#This is one of the strategies from Axelrod's Second Tournament for which we have the orginal Fortran code.
A description of this strategy is given in Axelrod, R. (1980). More Effective Choice in the Prisoner’s Dilemma. Journal of Conflict Resolution, 24(3), 379-403, where it is known as 'TESTER':
From our analysis of the Fortran code, the strategy:
This variable represents whether the strategy currently 'believes' that its opponent can be exploited. i.e. it believes that its opponent is a patsy.
The text was updated successfully, but these errors were encountered: