Name: Anonymous 2007-11-15 13:48
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 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.