Pages Tagged With complexity

  • An NP-Complete Puzzle Game

    By Bobby on 2009-01-04 18:32:35.114278
    NP-Complete problems are some of the most difficult problems to solve in Computer Science that do come up quite often. Many popular games are known to be NP-Complete (such as variable sized Sudoku). Here i describe another NP-Complete puzzle game and a simple proof by reduction from the Clique problem.