/prog/ Challenge Number 6

Hey guys and .. well, guys.

This time, the /prog/ Challenge is to design an algorithm that solves minesweeper fields.

Best algorithm wins. All algorithms have to execute in O(n) or O(n^2).

Good luck.

Funny fact: If you were able to solve the fucking queens, this is a joke; just change the check method from linear to areal and from simple binary (safe/unsafe) to analogue (number of fields, etc.).