Here is a game (Darling says I only blog about non-fun games. This post will NOT prove her wrong.)
Let D be a domain, d ≥ 1 and 0 ≠ a0 ∈ D. There are two players Wanda (for Wants root) and Nora (for No root). One of the players is Player I, the other Player II.
(1) Player I and II alternate (with Player I going first) choosing the coefficients in D of a polynomial of degree d with the constant term preset to a0.
(2) When they are done, if there is a root in D then Wanda wins, else Nora wins.
There is a paper by Gasarch-Washington-Zbarsky here where we determine who wins the game when D is Z,Q (these proofs are elementary), any finite extension of Q (this proof uses hard number theory), R, C (actually any algebraic closed field), and any finite field.
How did I think of this game? There was a paper called Greedy Galois Games (which I blogged about here). When I saw the title I thought the game might be that players pick coefficients from Q and if the final polynomial has a solution in radicals then (say) Player I wins. That was not correct. They only use that Galois was a bad duelist. Even so, the paper INSPIRED me! Hence the paper above! The motivating problem is still open:
Open Question: Let d be at least 5. Play the above game except that (1) the coefficients are out of Q, and (2) Wanda wins if the final poly is solvable by radicals, otherwise Nora wins. (Note that if d=1,2,3,4 then Wanda wins.) Who wins?
If they had named their game Hamilton Game (since Alexander Hamilton lost a duel) I might have been inspired to come up with a game about quaternions or Hamiltonian cycles.
POINT- take ideas for problems from any source, even an incorrect guess about a paper!