To access this work you must either be on the Smith College campus OR have valid Smith login credentials.

On Campus users: To access this work if you are on campus please Select the Download button.

Off Campus users: To access this work from off campus, please select the Off-Campus button and enter your Smith username and password when prompted.

Non-Smith users: You may request this item through Interlibrary Loan at your own library.

Publication Date


First Advisor

Gwen Spencer

Document Type

Honors Project

Degree Name

Bachelor of Arts


Computer Science


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 identified, 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 first two components, as ensuring the ability to generate effective 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 influenced 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




69 pages : color illustrations. Includes bibliographical references (page 69)