A Graphical Game, Southwesterly Snakes

Project Abstract

We consider a single player combinatorial game, "Southwesterly Snakes" played on a pair of partitions, each with the same fixed maximum part size and fixed maximum number of parts. The objective of the game is to find the least number of "snake moves" to move from one partition to another, where a snake move is an addition or removal of a series of adjacent boxes in the partition with the middle box lying on the main diagonal of the partition. We evaluate a strategy for completing the game by building a lattice based on partitions that summarizes the possible moves from each partition. Using this, we are able to determine, for any two partitions, which moves are necessary to move from one partition to the other.

Conference

Conference name: 2019 Joint Mathematics Meeting

Dates: 1/15/19-1/19/19

Sponsoring body: The Mathematical Association of America and the American Mathematical Society

Conference website: http://jointmathematicsmeetings.org/jmm

Funding Type

Travel Grant

Academic College

Jesse D. Jones College of Science, Engineering and Technology

Area/Major/Minor

Chemistry/Biochemistry and Mathematics major, Biology minor

Degree

Bachelor of Science

Classification

Senior

Name

Dr. Elizabeth Donovan

Academic College

Jesse D. Jones College of Science, Engineering and Technology

This document is currently not available here.

Share

COinS