[vessenes]

This is all pretty interesting. I think seeing every possible strategy compete with every other one makes for useful conversation, and his summary makes some sense to me, which is depending on ruleset, getting access to a pocket of what Stephen calls computational irreducibility generally can gain you the upper hand across a wide range of strategies is an interesting CS / Combinatorics result.

Probably most interesting is just throwing down a bunch of strategies that are provably better than tit for tat in rule constrained environments, and showing that some more complicated form of tit for tat doesn’t win as you get more space than your opponents - better is to manipulate simpler opponents into predictable behavior.

Anwyay, this particular Wolfram essay was devoid of name dropping, and full of interesting (if occasionally hard to parse) dense infographics, I enjoyed it and learned something.