| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:PYLOS
Authors:ID Zupanc, Nuša (Author)
ID Zmazek, Blaž (Mentor) More about this mentor... New window
Files:.pdf UNI_Zupanc_Nusa_2012.pdf (1,69 MB)
MD5: 34F21792BB31E37341D4DC642A316C0D
PID: 20.500.12556/dkum/0c9479c1-cf74-47df-9ece-ed205a57745a
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V diplomski nalogi smo poskušali najti zmagovalne strategije namizne igre Pylos. Pomagali smo si s teorijo iger in to povezali z nekaj znanja o teoriji grafov. Prvo in drugo poglavje diplomske naloge obravnava teorijo iger. Seznanili smo se z nastan- kom in razvojem teorije iger, omenili znane matematike in njihove prispevke k omenjeni teoriji. Spoznali smo osnovne pojme in predpostavke teorije iger in tako prek primerov iskali zmagovalne strategije v normalni in ekstenzivni obliki iger. V tretjem in četrtem poglavju smo se seznanili z osnovnimi pravili igre Pylos in poskušali idejo prvih dveh poglavij prenesti na proučevanje naše igre. Kljub razčlenitvi igre na različne težavnosti in celo na ploščo manjše dimenzije, smo ugotovili, da je za proučevanje potrebno več znanja s področja računalništva. Podobno kot pri igri šah, ima igra Pylos ogromno možnosti za preučevanje. Preiskovanje igre je najlažje izvesti s pomočjo algoritmov minimax in podobnih, ki jih izvaja računalnik. Zaradi obširnosti takšnih preiskovalnih dreves smo tako zapisali nekaj idej o zmagovalnih strategijah.
Keywords:Teorija iger, matrične igre, drevesa iger, igra Pylos.
Place of publishing:Maribor
Publisher:[N. Zupanc]
Year of publishing:2012
PID:20.500.12556/DKUM-36717 New window
UDC:51(043.2)
COBISS.SI-ID:19241480 New window
NUK URN:URN:SI:UM:DK:M2VBSJMX
Publication date in DKUM:16.07.2012
Views:3323
Downloads:253
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:PYLOS
Abstract:The first two chapters study game theory. We took a look through the history and got to know mathematician that were active in this field. We analyzed basic concepts of game theory through examples and definitions. In other two chapters of diploma we introduced game Pylos. In the description of the game we used knowledge from the first two chapters of diploma. With game analysis in different situations we determined that we don't have enough knowledge about computer science and artificial inteligence. This is the only rational way to find solutions in game Pylos. Minimax algorithm with alphabeta pruning is the best approach to this game. This technique works on a fast-enough computers. The algorithm can look far enough ahead to play a very good game. The important thing to keep in mind, is that this is nothing like human thought. When we learn how human thinking works and create computers that uses those techniques to play such games, we will be onto something.
Keywords:Game theory, gaames in normal form, games in extensive forms, game Pylos.


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