Hosted on GitHub Pages using the Dinky theme
This is also from Introduction to University Mathematics through Games written by Prof. Yasuda (in Japanese). In that book, the Lights Out game is studied mathematically. For n=1,2,3, the matrix can always be turned to the zero matrix by applying the operations. However, for n=4,5 there are some examples which cannot be turned to the zero matrix.
The problem above was given as a midterm assignment in Linear Algebra. You can see the programming code here (written in Japanese). It was quite hard work for me…