z-logo
open-access-imgOpen Access
A SURVEY OF NP-COMPLETE PUZZLES
Author(s) -
Graham Kendall,
Andrew J. Parkes,
Kristian Spoerer
Publication year - 2008
Publication title -
icga journal
Language(s) - English
Resource type - Journals
eISSN - 2468-2438
pISSN - 1389-6911
DOI - 10.3233/icg-2008-31103
Subject(s) - computer science
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the approaches for solving them, have emerged. However, many puzzles have been neglected, possibly because they are unknown to many people. In this article, we survey NP-Complete puzzles in the hope of motivating further research in this fascinating area, particularly for those puzzles which have received little scientific attention to date.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom