Post

In this minigame, you have a 3by3 grid of cells. Each cell can be on, or off. By clicking on a cell, you toggle the cell and the direct neighbours (NOT DIAGONALLY). Your task is turn the whole grid "on" as quickly as possible on as many random start positions as possible.

It became apparent quickly, that there are "easy" starting positions and "hard" ones. For the harder ones, I always ended up randomly clicking around until I found a familiar place, where I knew how to finish. And then I wondered what the optimal way was to solve each starting position

So after a long day of work in front of my laptop, I decided to not spent time with my wife and open up my macbook again to build a solver... And now, 2 hours later, it's done: andrewgreenh.github.io/moriarty-con... Each grid displays a number (the steps to finish) on the next cell to click.