There's a variety of NP-Complete problems like the Clique problem, the Hamiltonian cycle problem, Satisfiability, etc.(adsbygoogle = window.adsbygoogle || []).push({});

Recently i discovered a simple puzzle problem that is NP-Complete (the proof involves a straightforward reduction of the Clique problem).

Anyway, i built the actual puzzle game, using flash and i think it's cool because it illustrates the difficulty of solving NP-Complete problems and why, in all likelihood, P != NP.

http://www.bloo.us/blog/?blogger=4&pid=13 [Broken]

I'm thinking of putting together a site with NP-Complete puzzle games. I can think of a couple of others.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# NP Complete Puzzle game

Loading...

Similar Threads for Complete Puzzle game | Date |
---|---|

A Gaussian Process Puzzle | Jun 7, 2017 |

Lattice/Complete lattice | Jun 10, 2014 |

Confidence of complete spatial randomness | May 8, 2014 |

Complete Random Design vs RCBD | Sep 7, 2013 |

Completeness notions in logic | Feb 23, 2013 |

**Physics Forums - The Fusion of Science and Community**