/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.

this code runs on my quantum computer:

Universe universe = new Universe();

while not minesweeper_solved(universe)
     universe = new Universe();

print_minesweeper(universe.getInstanceByPattern(Pattern.MINESWEEPER_SOLVED)))
}

run time is O(sqrt(n))