Archive for October 31st, 2005
The last day
It was this day, one year ago.
A lot has happened, a lot had happened.
Some I remember, some I forget.
But it is that very day, which in my mind still remains.
To clear it seems, to clear it feels.
Do I need to forget, or do I not?
Do I want to forget, or do I not?
Maybe some day I will, or maybe never.
Whichever the case, I hoped I’ve moved on; I want to move on.
To make better memories of the days to come
To someday look back and be able to smile
But can that be found in the present?
How long more will it take?
Well Lord you know all things
So where do we go from here?
Anyway, Happy Halloween y’all
Minesweeper and NP-Completeness
One reason why I don’t find Minesweeper a fun game is that oftentimes it’s just a game of chance. After working so hard to uncover 98 mines I usually come to a point where the last mine is hidden under a few tiles of equal probabilty. What difference is this than rolling a dice or tossing a coin?
Well here’s a new way to play Minesweeper.
Instead of trying to uncover the mines, we shall verify that a given state of the game is possible. In other words I present to you a “freeze-frame” of a Minesweeper game, with some tiles uncovered, some flagged as mines, and the rest covered and you tell me if that is a possible scenario.
Now the game is actually solvable without any element of luck like the Sudoku puzzle. Idea was from an interesting way to present the P=NP? problem with Minesweeper, which by the way is NP-Complete.
We need more lecturers who can present ideas in such fun and creative ways.







