$x$ Plays Pokemon, for Almost-Every $x$
By: C. Evans Hedges
Potential Business Impact:
Makes a computer always win any game.
This paper provides a brief write-up showing that for any finite state game, a disjunctive number $x$ will eventually win that game. The proof techniques here are well known and this result follows immediately from folklore results in graph theory and cellular automata. This short paper primarily serves as an expositional piece to collect this proof with the fun context of $π$ Plays Pokémon serving as motivation.
Similar Papers
Tie-breaking Agnostic Lower Bound for Fictitious Play
CS and Game Theory
Makes game learning slower than thought.
Markov Chains of Evolutionary Games with a Small Number of Players
CS and Game Theory
Helps predict how groups of people make choices.
Evolutionary Analysis of Continuous-time Finite-state Mean Field Games with Discounted Payoffs
Systems and Control
Helps many players make better choices together.