[jhhnzirw] Pokémon for binary memorization

Design a set of n characters and the n(n-1)/2=O(n^2) pairs of who beats whom.  There may be cycles like rock-paper-scissors.

Play a game that tests your knowledge how well you've memorized the strength graph.  Make the game elaborate to aid memorization.

The actual goal is to memorize the O(n^2) bits encoded in the edges of the graph.  17 characters is enough for 128 bits, though we probably want more for error correction.