Presenter Information

Roy Oursler, University of Wyoming

Department

Mathematics

First Advisor

Dr. Jason Williford

Description

The game K 3 - saturator is a combinatorial game. This game is pla yed 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 gam e. 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 cas es of K 3 - saturator.

Comments

Oral Presentation, Wyoming NSF EPSCoR

Share

COinS
 

Optimal Strategies of K 3 - Saturation Games

The game K 3 - saturator is a combinatorial game. This game is pla yed 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 gam e. 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 cas es of K 3 - saturator.