Date of Publication
8-30-2022
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with Specialization in Computer Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics Department
Thesis Advisor
Ederlina G. Nocon
Defense Panel Chair
Isagani B. Jos
Defense Panel Member
Noel T. Fortun
Abstract/Summary
Chess is a classic board game that most people know about. Much research regarding chess has already been done, including the optimal opening strategies a player can do, the million possible combinations of a single chess game, possible endgame situations, and many more. This study is an exposition of the paper on chess endgames written by Zvi Retchkiman Königsberg. In this paper, we analyze and discuss strategies for chess games formed only by pawns and built around a position called Zugzwang. In such a position, a player is forced to be in a situation where it would be more beneficial to skip a turn than make a move. To help the reader better understand the concepts tackled in the paper, basic concepts of combinatorial game theory are discussed with illustrations specifically constructed in chess game scenarios. It is the goal of this thesis to provide easy-to-read material that will be useful for those who would like to study combinatorial games as applied to the game of chess.
Abstract Format
html
Language
English
Format
Electronic
Physical Description
63 leaves
Keywords
Chess—End games; Game theory
Recommended Citation
Jimenez, C. C., & Palaca, A. I. (2022). Strategic planning using combinatorial game theory on chess endgames. Retrieved from https://animorepository.dlsu.edu.ph/etdb_math/18
Upload Full Text
wf_yes
Embargo Period
8-29-2022