| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:MATEMATIČNI MODEL IGRE ENKA
Authors:ID Toš, Irena (Author)
ID Jerebic, Janja (Mentor) More about this mentor... New window
Files:.pdf UNI_Tos_Irena_2012.pdf (903,92 KB)
MD5: 822227A5BE620B4FF0E7D41BA60BBBAA
PID: 20.500.12556/dkum/24c3ba63-f3d4-40e8-842f-156908f7f92b
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Diplomsko delo, ki je razdeljeno na tri poglavja, predstavlja matematični model igre Enka. V prvem poglavju bomo najprej definirali in opredelili osnovne pojme, ki jih bomo potrebovali v nadaljevanju. V drugem poglavju bomo predstavili dva matematična modela Enke in njuni obliki ter definirali graf Enke. Sledila bo karakterizacija ENKA-1 grafov, nato bo predstavljen še graf šahovnice, ki je definiran podobno kot ENKA-1 graf. V zadnjem poglavju bomo predstavili zahtevnosti Enke z dvema igralcema in Enke z enim igralcem. Pokazali bomo, da sta pripadajoča problema ENKA-2 in ENKA-1 $NP$-polna problema.
Keywords:igre na grafih, Enka, dvodelni grafi, grafi povezav, graf Enke
Place of publishing:Maribor
Publisher:[I. Toš]
Year of publishing:2012
PID:20.500.12556/DKUM-22035 New window
UDC:51(043.2)
COBISS.SI-ID:18983944 New window
NUK URN:URN:SI:UM:DK:IQNDASO6
Publication date in DKUM:12.03.2012
Views:3507
Downloads:157
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:MATHEMATICAL MODEL OF UNO
Abstract:The purpose of this graduation thesis is to present mathematical model of the card game Uno and is divided into three sections. First section of the thesis defines basic concepts, which will be used throughout this study. Second section presents two mathematical models, their forms and define graph of Uno, followed by characterization of graph UNO-1. In addition, second section includes chessboard, which is defined similarly as graph UNO-1. Last section presents complexity of Uno with two players and Uno with one player. Moreover, the third section of this graduation thesis demonstrates that associated problems of UNO-2 and UNO-1 are $NP$- complete.
Keywords:games on graphs, Uno, bipartite graph, line graph, Uno graph


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica