alt Hacker NewsReminds me of Zachtronics: Take a computationally difficult problem, reduce it to a game, and then score people against each other.
Pure genius and nerd snipe marksmanship.
Did you know multi-robot exploration pretty much as laid out in Exapunks has loose but well studied bounds on number of agents, bits of information, and exploration steps?
For example, one agent with only one pebble cannot explore all graphs?
This is exactly the trick one of my colleagues uses to teach Theory of Computation, a notoriously boring subject (for your average CS student). Instead of motivating reductions by blathering on about how knapsack and TSP are the same, let them choose a fun video game and show how it can be solved using integer programming or something. Students have way more fun and end up actually enjoying the proofy parts, because they have actual practical value.