Analysis of optimal solutions and its tiling in m X n size Black-Out Game
김덕선, Sang‐Gu Lee · Communications of Mathematical Education · 2007
For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie Beautiful mind, we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized Blackout game. New proof and algorithm will be given with a visualization.