(he/they) Professor of Computer Science at Florida Southern College. Researcher: Computational Complexity and Combinatorial Game Theory. Interested in: Voting Systems, HPC + OOP, Magic: The Gathering.
A nice discussion of different proofs of the Hex Theorem: https://www.pureabstracts.com/blog/hex-cannot-end-in-a-draw
One of my students coded up some Toads and Frogs games last year and this semester wanted to improve the Elephants and Rhinos positions so they were all generated with mean value of zero.
The issue is that if you generate really random E&R boards, they are often either extremely unbalanced or there are very few moves available.
They got it working! Now you can play Elephants and Rhinos games where it's complicated to find and make the best moves. Try it out here:
https://kyleburke.info/DB/combGames/elephantsAndRhinos.html
(I don't want to say it's "hard" because you can still find them in polynomial time.)