I quit. I have no chance.

[carykh]

I quit. I have no chance.

[ReimarPB]

Just tried it myself, mine went down to 36th. It really shows how different the actual tournament is gonna be from the sample strats.

[Barigamb738]

Yeah, I drastically overestimated my algorithm.

[Quadrapod]

It looks like my strategy is still able to take first here but I will say just because you don't think you'll win doesn't mean there's no value in competing. These are all pretty well refined scripts which are heavily optimized for that pool of competitors. The actual contest will be different and really it's not impossible for something like tit for tat to win in the end. It wouldn't even be the first time it's happened.

[l4vr0v]

Just for the record, some of the strategies- including the really good strategies with PascalCase names- in my repo are made by @Lasermancer. I included them in my repo (at his request) to test their performance in a competitive meta back when he was not yet familiar with git and GitHub. I will remove them now. I am not dominating this myself, and my own submission (npnntt) is likely not going to be very competitive. (@Lasermancer, @nobody5050, and I have been collaborating fairly closely and our strategies tend to riff off of each other's. I highly recommend doing something similar with [internet] friends. You will find yourself developing really cool strategies!)

That aside:

1. Some strategies are very meta-sensitive. Compare the performances in my repo vs. the performances in the broader Prisoners-Dilemma-Enjoyers repo which has even more strategies.
2. With a few key insights (forgiveness, opportunistic defection, minimal and effective punishment), your strategy can rocket up in performance. npnntt still does decently in some metas and that strategy is just "tit for tat, but cooperate if they defected after my defection unless they've never cooperated with me before."

Don't give up hope! You can get very very far.

[Barigamb738]

Thanks guys. I will give it another shot.