I've created an interesting (at least to me) game that I think others might enjoy. It's based on the Prisoner's Dilemma (<a href="https://en.wikipedia.org/wiki/Prisoner%27s_dilemma" rel="nofollow">https://en.wikipedia.org/wiki/Prisoner%27s_dilemma</a>). Specifically, my inspiration is Axelrod's tournament/experiment (<a href="https://cs.stanford.edu/people/eroberts/courses/soco/projects/1998-99/game-theory/axelrod.html" rel="nofollow">https://cs.stanford.edu/people/eroberts/courses/soco/project...</a>) from the 1980s.<p>In summary, you create a strategy that's exposed via HTTP. Multiple times a day, my game server matches your strategy with someone else's, and the two strategies play a variation of the Iterated Prisoner's Dilemma. The server tracks scores and displays them on a leaderboard. All decisions from every matchup are available for public viewing.<p>I believe there are some interesting optimizations that will lead to an engaging challenge. Specifically, your strategy is aware of its opponent's ID from the start of the matchup, and all the opponent data is available publicly.<p>Right now, it's running in "beta" mode so that I can incorporate any feedback (which I'd love to have!). If you have ideas on how to improve this to make it more challenging/fun/etc., please let me know.