Publication Date
1-1-2023
Document Type
Article
Publication Title
Integers
Volume
23
DOI
10.5281/zenodo.8174520
Abstract
We introduce a version of Nim played on a Boolean matrix. Each player, in turn, removes a nonzero row or column. The last player to remove a row or column wins. We investigate the Boolean matrices that represent the Ferrers diagram of an integer partition. An integer partition in which each summand is greater than the number of terms in the partition is said to be strong. The Grundy numbers of Boolean matrices that represent the Ferrers diagram of any integer partition consisting of three or fewer terms are determined. This allows us to classify the P-positions and N-positions of Boolean matrices that represent the Ferrers diagram of any strong integer partition.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Department
Mathematics and Statistics
Recommended Citation
Stephen J. Curran, Stephen C. Locke, and Richard M. Low. "A VARIANT OF NIM PLAYED ON BOOLEAN MATRICES" Integers (2023). https://doi.org/10.5281/zenodo.8174520
