SOME LUMINESCENCES ABOUT THE GAME LIGHT OUT
DOI:
https://doi.org/10.34179/revisem.v9i4.18897Abstract
The theory behind the Lights Out game has been developed by several authors. The aim of this paper is to present some new results related to this game using linear algebra. We establish a criterion for the solvability of this game in the case of an m by n grid, which depends on whether a certain matrix is invertible, and we present the conditions for this to occur, which can be easily verified from m and n. In addition, we explicitly determine the value of the determinant for a particular case.
Keywords: Block tridiagonal matrix, Kronecker product, determinant, Lights Out game.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Mari Sano, Adriano Verdério, Izabele D’Agostin, Patrícia Massae Kitani
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Licença Creative Commons
Permite remixagem, adaptação e nova criação a partir da obra para fins não comerciais, e que seja atribuído o crédito ao autor (CC BY-NC) |