Message from @realz
Discord ID: 781083552946978816
uh I dunno if minesweeper can be framed as a P vs NP problem
lol
it apparently can be framed as a minesweeper problem
but it would not be a typical game lol
this is kinda beautiful
I've proved another game to be NP-hard, and it looked like this sort of thing
`The link to the computer game comes when we introduce the
Minesweeper Consistency Problem. This is not to find the
mines, but to determine whether a given state of what
purports to be a Minesweeper game is or is not logically
consistent.`
it is not a regular game of minesweeper
oh gosh my mind
Sorry... I just remember a prof trying to explain it to us and using minesweeper as an example... its been long enough since I thought about it so I can't speak intelligently on it
Traveling Salesman Problem is the classic example
I just remember its one of the classically difficult math equations to represent and prove or disprove
visit every state capital by plane, in the shortest distance traveled
the reference was because I used to spend a lot of time disproving various "proofs" purporting to have solved the problem
@realz, you just advanced to level 17!
!rank
can't catch up to the talkative geese
I got rendered hairballs!
it just gets worse
HAHAHA
K.
I dunno what this means
BUNK
lol
uh let me check the settings tho
this is with a 15 minute threshold
maybe I should do 5?
God damn tealeaves.
lol
gosh that is a lot of matches
let me lower the theshold
I think all this stuff in RAM literally broke my clipboard
I can't copy paste anymore
That's never a good sign