Have you ever played "Minesweeper" or "Lights Out!" and wondered what it would be like to reverse the process? Me too! Say hello to a 10 by 10 grid that I like to call "Number Dash":
Your objective is simple; activate all of the tiles in the grid in the fewest moves possible.
How to Play
To activate tiles you must tap on tiles that are already active. Tapping an active tile will cause a few things to happen. To define this, let $T$ represent the tapped tile.
- Any inactive adjacent tiles are activated.
- The face value of $T$ is reduced by the number of active adjacent tiles.
- This count excludes tiles that were inactive before step 1.
- For each adjacent tile (excluding tiles that were inactive before step 1):
- If its face value is odd, subtract the newly reduced face value of $T$.
- If its face value is even, add the newly reduced face value of $T$.
- The opening move is exempt from reductions in face value.
- A tile's face value cannot exceed 9, any greater value is simply truncated.
- A tile's face value cannot go negative, it stops at zero.
- When a tile's face value is equal to zero, it is inactive.
The Interactive Puzzle
I've built an interactive version of the puzzle (e.g. the game can actually be played) that will let you quickly test theories. Feel free to use it to avoid the hassle of paper solving for everything. The no-computers tag was removed to enable the community to use the interactive puzzle. However, keep in mind that even though the no-computers is no longer specified, answers relying on brute force or computer programming to solve this puzzle will be disqualified.
Furthermore, to simplify writing your answer, if you open your developer tools (typically by pressing the F12 key), the console logs each move you make:
If you need further information on opening developer tools in your respective operating system and web browser, here is an article that should be able to help.
For simplicity, answers can use a simple notation of $T[x, y]$ to represent moves:
T[1,4] T[1,7] T[2,6] ...
Additionally, answers should use $1$ based indexing for consistency; so the grid has a minimum value of $T[1, 1]$ and a maximum of $T[10, 10]$. On a final note, this format should not be considered as case-sensitive. If you prefer $t$ over $T$, then use $t$.
What is the fewest number of moves required to activate every tile in this grid?