Winning Strategies for Matrix Games

Additional Funding Sources

The research described was supported by Boise State University.

Presentation Date

7-2020

Abstract

Consider a square matrix M in Z2, equal to its transpose, with a northwest-southeast diagonal of zeros. The mcds operation, when applied repeatedly to such a matrix M, terminates either in the zero matrix or else in several matrices, each with at most six ones located in specific positions within the matrix. The variability in outcomes for the results of this operation suggests a basis for a finite combinatorial game. In this project we explore winning strategies for the game in question and examine the possible ending configurations of the process upon which it is based.

This document is currently not available here.

Share

COinS
 

Winning Strategies for Matrix Games

Consider a square matrix M in Z2, equal to its transpose, with a northwest-southeast diagonal of zeros. The mcds operation, when applied repeatedly to such a matrix M, terminates either in the zero matrix or else in several matrices, each with at most six ones located in specific positions within the matrix. The variability in outcomes for the results of this operation suggests a basis for a finite combinatorial game. In this project we explore winning strategies for the game in question and examine the possible ending configurations of the process upon which it is based.