20.500.12556/RUL-80175 NP-polnost miselnih iger in ugank diplomsko delo NP-completeness of mind games and puzzles Najtežje probleme v NP imenujemo NP-polni problemi, za njih pa trenutno velja, da jih ne znamo rešiti v polinomskem času. NP-polne odločitvene probleme najdemo na različnih področjih, od teorije grafov, do izjavne logike, nadalje pa velja, da ob odkritju rešitve enega od problemov znamo rešiti tudi vse druge NP-polne probleme. V diplomskem delu se bomo osredotočili predvsem na NP-polne probleme, povezane z reševanjem miselnih iger in ugank. Naredili bomo pregled nekaterih znanih miselnih iger in pokazali njihovo NP-polnost. Dokaz NP-polnosti izbranih problemov bo temeljil na dejstvu, da med NP-polnimi problemi obstajajo prevedbe. Za vsako miselno igro bomo torej najprej opisali igri pripadajoči odločitveni problem, nato pa reševanje nekega že znanega NP-polnega odločitvenega problema prevedli na reševanje igri pripadajočega odločitvenega problema. 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. odločitveni problem uganka računska zahtevnost NP-polnost prevedba decision problem puzzle computational complexity NP-comple-teness reduction true false false [S. Pahor] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2016-02-03 14:05:06 2016-02-03 14:05:09 2024-08-02 11:15:49 0000-00-00 00:00:00 2016 0 0 52 str. 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 16161 1536772803 Pahor_Samo_-_NP-polnost_miselnih_iger_in_ugank.pdf Pahor_Samo_-_NP-polnost_miselnih_iger_in_ugank.pdf 1 C250CBF6523D1ED19DF70166C9FA025F 825d1ca77a7e901483866096291f0c7a6000bd2aeb5960507529c2e297dd282a 4134b7e1-a1a9-11eb-a523-00155dcfd717 20.500.12556/rul/1ff1e0c6-f4e9-4242-b720-8945fe57990f https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=80219 Fakulteta za računalništvo in informatiko 0 0 0