MinesweeperisNP-Complete.pptVIP

Unprepped column, wrong piece * 3-Partition Given 3s integers a1, a2, …, a3s, can you partition into s triples with the same sum? Know the sum must be T ∑ai / s This problem is strongly NP-complete:NP-complete even if ai numbers are sO 1 … ? T s triples Initial Board s columns one per sum ≈ T notches target sum T lock bane it is possible toactually get here Piece Sequence For each input ai: ai reps Failure to Launch Forced Moves FinalePieces FinalePieces FinalePieces FinalePieces FinalePieces FinalePieces Summary If there’s a 3-partition, can win Tetris:Get tons of lines, Tetrises, live forever, etc. If there’s no 3-partition, must lose Tetris:Die, no lines, no Tetrises, etc. Open Problems What if the initial board is empty? What about Tetris with O 1 columns? What about Tetris with O 1 rows? What about restricted piece sets e.g. just What if every move drops from high up no last-minute slides ? Is two-player Tetris PSPACE-complete? What can we say about online regular Tetris? * * * * * * * * * * * * * * * * * * Minesweeper is NP-Complete Notes by Melissa Gymrek Based on a paper by Richard Kayes 2000 Minesweeper Reducing 3SAT to generalized Minesweeper Reducing cSAT to well-know version of Minesweeper MINESWEEPER: G, ξ |G is a graph and ξ is a partial integer labeling of G, and G can be filled with mines in such a way that any node v labeled m has exactly m neighboring nodes containing mines. Deciding if a graph is in the MINESWEEPER language is NP-complete: - Polynomial time verification - Reduce from 3SAT in polynomial time General Minesweeper For each node v labeled m: Check that exactly m neighbors contain mines O E time – clearly polynomial Polynomial Time Verification Reduce from 3SAT 3SAT instance w MINESW instance Z f w Function f converts a 3SAT instance to a MINESW instance in polynomial time Z is satisfiable iff w is satisfiable Boolean 3CNF formula: A V B V C ^ ~A V D V ~C ^ … N variables A, B, C, D in