1/1
3 files

Optimal Strategies of K3-Saturation Games

presentation
posted on 07.08.2014, 00:00 by Roy Oursler
The game K 3-saturator is a combinatorial game. This game is played by two players who take turns connecting a predetermined number of points together. If a player connects three of the points together to form a triangle, then that player loses. This presentation explains the winners of the 9 smallest cases of this game. It also explains a strategy for K 3-saturator and some similar games. These strategies are then used in an attempt to theoretically determine the winner of this game. The strategies employed have solved a few games similar to K 3-saturator and a few cases of K 3-saturator.

History

Advisor

Williford, Jason

ISO

eng

Language

English

Publisher

University of Wyoming. Libraries

Usage metrics

Keywords

Licence

Exports