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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Zermelo's Theorem: How To Reach A Standard of Perfect Play in Chess

Scholarly and Creative Works from DePauw University (DePauw University)
Artificial Intelligence in Games
article

Zermelo's Theorem: How To Reach A Standard of Perfect Play in Chess

article en

Abstract

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.

Scholarly and Creative Works from DePauw University (DePauw University)
Openalex Percentile: Top 54%
Artificial Intelligence in Games
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Zermelo's Theorem: How To Reach A Standard of Perfect Play in Chess · Scholarly and Creative Works from DePauw University (DePauw University) (2024) | TGRS Research Map | TGRS