solipsist comments on Prisoner’s Dilemma (with visible source code) Tournament

solipsist 24 Jun 2013 16:53 UTC
1 point
0
I strongly recommend writing a MimicBot that goes through two iterations before allowing itself to exit with a fixed probability.

You can deal with those special cases that way. I was going to use a flatter, less quiny approach.
```
def special_casing_bot(opponent)
    if acts_like_cooperate_bot(opponent):
        return DEFECT
    elif act_like_other_exploitable_bot(opponent):
        return DEFECT
    elif special_case_3(opponent):
        return DEFECT
    elif special_case_4(opponent):
        return COOPERATE
    elif special_case_5(opponent):
        return DEFECT
    # etc
    else:
        return mimic_bot(opponent)
```
- So8res 24 Jun 2013 17:14 UTC
  0 points
  0
  Parent
  Depending upon the implementation of mimic_bot, this is a quiny approach. mimic_bot obviously can’t run the opponent on an exact quine of yourself, because then you won’t achieve mutual cooperation. (When one of the bots cooperates unconditionally, the other will see that it acts_like_cooperate_bot and defect.) So long as mimic_bot plays opponents against a pure MimicBot instead of a perfect quine, this should work quite well.
  
  On an unrelated note, woah, how’d you get whitespace working?
  - solipsist 24 Jun 2013 17:20 UTC
    9 points
    0
    Parent
    
    On an unrelated note, woah, how’d you get whitespace working?
    
    Total kludge. Used exotic unicode whitespace characters#Spaces_in_Unicode), which are displayed unaltered in comments :-).