Date of Award
Master of Science (MS) in Mathematics
"In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis"--Document.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Frenk, Anthony, "The Gordon game" (2013). EWU Masters Thesis Collection. Paper 235.