ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

NP-completeness of mind games and puzzles

Samo Pahor (2016) NP-completeness of mind games and puzzles. EngD thesis.

Download (10Mb)


    The hardest problems in NP are called NP-complete problems; these are problems that we currently do not know how to solve quickly. There is a variety of NP-complete decision problems in different fields, ranging from graph theory to logic and also note that upon finding a solution to one NP-complete problem, we are able to solve any problem that belongs to the NP-complete class of problems. The thesis will focus on NP-complete problems related to solving puzzles and brain-teasers. We will present a summary of a few well known puzzles and show that they are indeed NP-complete. The proof for their NP-completeness will stem from the existence of transformations (or reductions) between them. For each puzzle we will first present the respective decision problem and then transform the solving of an already proven NP-complete decision problem to solving the decision problem pertaining to each puzzle.

    Item Type: Thesis (EngD thesis)
    Keywords: decision problem, puzzle, computational complexity, NP-comple\-teness, reduction
    Number of Pages: 52
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Jurij Mihelič305Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536772803)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3234
    Date Deposited: 02 Feb 2016 10:02
    Last Modified: 18 Feb 2016 09:30
    URI: http://eprints.fri.uni-lj.si/id/eprint/3234

    Actions (login required)

    View Item