Document Type

Poster

Publication Date

Summer 2024

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.

Comments

Mentors: Dr. Gelonia Dent and Dr. William Massey for their guidance and general support they have given me over the past 3 years.

Thanks to CAARMS24 sponsors!

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.