Bachelor of Arts
Rmasey games, Graphy theory, Computer science, Algorithms, Ramsey's theorem, Ramsey theory
This project is an exploration of the strategy space of two player, achievement (or constructive) Ramsey games. To begin, we created graph and player classes in Python. Five basic strategies were identiﬁed, and–in order to optimize the utilization of these strategies–genetic algorithms were applied. Ultimately, exploration was broken down into four main components: custom or bespoke evolutions, general evolutions, performance against advanced opponents, and adjusting and optimizing experiment parameters. The bulk of the project is dedicated to the ﬁrst two components, as ensuring the ability to generate eﬀective and versatile strategy chromosomes using genetic algorithms is the primary goal of this thesis. A secondary goal is attempting to understand how the system is inﬂuenced by its numerous parameters.
2018 Theodore McCulloch. Access limited to the Smith College community and other researchers while on campus. Smith College community members also may access from off-campus using a Smith College log-in. Other off-campus researchers may request a copy through Interlibrary Loan for personal use
McCulloch, Theodore, "Exploring the evolution of Ramsey games" (2018). Honors Project, Smith College, Northampton, MA.
Off Campus Download