Zermelo's Theorem: How To Reach A Standard of Perfect Play in Chess
Zermelo’s theorem establishes that in any two player zero-sum game with perfect information (without the element of chance), either one side can force a win regardless of how the other side plays, or both sides can force a draw (if allowed in the rules). This theorem encouraged me to see how I could better my chess to see if I could exploit the existence of this perfect standard. I considered how chess engines play, as they are currently the strongest at playing chess. I understood that they often look 60-70 moves deep from the opening stage of the game, which leads to the endgame. I decided to mimic this method by finding a statistical correlation between opening moves and the type of endgames that may occur from them.
Publication Details
- Journal
- Scholarly and Creative Works from DePauw University (DePauw University)
- Published
- 2024-10-01
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00