Victory! Sweet Victory!

At last, I have solved Minesweeper at the highest difficulty level. Well, a Linux clone of it, xbomb.

The 30x16 grid, solved!

I have come close–two mines to find, and I either slipped up or deduced incorrectly.

This is the first time I’ve solved the whole thing.

The top right corner, as you might guess, proved to be the tricky place. I reached a point where I had to make a guess, and when I guessed correctly, everything unraveled easily.

I feel a bit like I did when I solved the 5×5 Rubik’s Cube. It’s done, and I never have to do that again. 🙂

Published by Allyn Gibson

A writer, editor, journalist, sometimes coder, occasional historian, and all-around scholar, Allyn Gibson is the writer for Diamond Comic Distributors' monthly PREVIEWS catalog, used by comic book shops and throughout the comics industry, and the editor for its monthly order forms. In his over fifteen years in the industry, Allyn has interviewed comics creators and pop culture celebrities, covered conventions, analyzed industry revenue trends, and written copy for comics, toys, and other pop culture merchandise. Allyn is also known for his short fiction (including the Star Trek story "Make-Believe,"the Doctor Who short story "The Spindle of Necessity," and the ReDeus story "The Ginger Kid"). Allyn has been blogging regularly with WordPress since 2004.

Leave a Reply

Your email address will not be published. Required fields are marked *