Marathon Match 122

Topcoder MM 122 - **SuperMinesweeper** is now live!

Problem Setter: dimkadimon
Problem Testers: JacoCronje and kphmd

Problem Overview: 
Super Minesweeper is a game where you must locate **M** mines that have been hidden somewhere on an **N**x**N** grid. Each cell of the grid is either a mine or a value. A value in cell X represents the number of mines in cells Y whose squared Euclidean distance from cell X is **D** or less. The game begins with all cells hidden except for a single cell with a zero whose location is provided. In each move, you can uncover one cell of the grid. Unlike the classic Minesweeper, the game continues when you uncover (hit) a mine, but you lose points. Your task is to uncover as many values as possible while minimizing the number of mines you have hit. In particular, your raw score is the percentage of values uncovered divided by the number of mines you have hit plus one.

Here is an animation of a solution for seed=1. (You can see the working animation here: https://mailchi.mp/topcoder/marathon-match-122)