@@ -650,32 +650,31 @@ def strategy(self, opponent: Player) -> Action:
650
650
return random_choice (prob_cooperate )
651
651
652
652
653
- class UnnamedStrategy (Player ):
654
- """Apparently written by a grad student in political science whose name was
655
- withheld, this strategy cooperates with a given probability P. This
656
- probability (which has initial value .3) is updated every 10 rounds based on
657
- whether the opponent seems to be random, very cooperative or very
658
- uncooperative. Furthermore, if after round 130 the strategy is losing then P
659
- is also adjusted.
660
-
661
- Fourteenth Place with 282.2 points is a 77-line program by a graduate
662
- student of political science whose dissertation is in game theory. This rule
663
- has a probability of cooperating, P, which is initially 30% and is updated
664
- every 10 moves. P is adjusted if the other player seems random, very
665
- cooperative, or very uncooperative. P is also adjusted after move 130 if the
666
- rule has a lower score than the other player. Unfortunately, the complex
667
- process of adjustment frequently left the probability of cooperation in the
668
- 30% to 70% range, and therefore the rule appeared random to many other players.
653
+ class FirstByAnonymous (Player ):
654
+ """
655
+ Submitted to Axelrod's first tournament by a graduate student whose name was
656
+ withheld.
669
657
670
- Names :
658
+ The description written in [Axelrod1980]_ is :
671
659
672
- - Unnamed Strategy: [Axelrod1980]_
660
+ > "This rule has a probability of cooperating, P, which is initially 30% and
661
+ > is updated every 10 moves. P is adjusted if the other player seems random,
662
+ > very cooperative, or very uncooperative. P is also adjusted after move 130
663
+ > if the rule has a lower score than the other player. Unfortunately, the
664
+ > complex process of adjustment frequently left the probability of cooperation
665
+ > in the 30% to 70% range, and therefore the rule appeared random to many
666
+ > other players."
667
+
668
+ Given the lack of detail this strategy is implemented based on the final
669
+ sentence of the description which is to have a cooperation probability that
670
+ is uniformly random in the 30 to 70% range.
671
+
672
+ Names:
673
673
674
- Warning: This strategy is not identical to the original strategy (source
675
- unavailable) and was written based on published descriptions.
674
+ - (Name withheld): [Axelrod1980]_
676
675
"""
677
676
678
- name = "Unnamed Strategy "
677
+ name = "First tournament by Anonymous "
679
678
classifier = {
680
679
"memory_depth" : 0 ,
681
680
"stochastic" : True ,
0 commit comments