Algumas luminescências sobre o jogo Lights Out

Adriano Verdério, Izabele D'Agostin, Mari Sano, Patrícia Massae Kitani
{"title":"Algumas luminescências sobre o jogo Lights Out","authors":"Adriano Verdério, Izabele D'Agostin, Mari Sano, Patrícia Massae Kitani","doi":"arxiv-2403.17967","DOIUrl":null,"url":null,"abstract":"The theory behind the Lights Out game has been developed by several authors.\nThe aim of this work is to present some results related to this game using\nLinear Algebra. We establish a criterion for the solubility of this game in the\ncase of an $m$ by $n$ grid, which depends on the invertibility of a matrix, and\nwe present the conditions for this to occur, easily verifiable from $m$ and\n$n$. Furthermore, we explicitly determine the value of the determinant for a\nparticular case.","PeriodicalId":501462,"journal":{"name":"arXiv - MATH - History and Overview","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - History and Overview","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2403.17967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The theory behind the Lights Out game has been developed by several authors. The aim of this work is to present some results related to this game using Linear Algebra. We establish a criterion for the solubility of this game in the case of an $m$ by $n$ grid, which depends on the invertibility of a matrix, and we present the conditions for this to occur, easily verifiable from $m$ and $n$. Furthermore, we explicitly determine the value of the determinant for a particular case.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
熄灯游戏的几个缩影
熄灯游戏背后的理论已由多位作者提出。本作品的目的是利用线性代数提出与该游戏相关的一些结果。我们为这个游戏在 $m$ 乘 $n$ 网格的情况下的可解性建立了一个标准,这个标准取决于矩阵的可逆性,我们提出了发生这种情况的条件,从 $m$ 和 $n$ 可以很容易地验证。此外,我们还明确确定了特定情况下的行列式值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Roger Godement et les fonctions de type positif Winning Lights Out with Fibonacci A Mathematical Model of The Effects of Strike On Nigerian Universities Generalized Carlos Scales Samgamagrāma Mādhava: An Updated Biography
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1