Pylos

diplomsko delo

Nuša Zupanc (Author), Blaž Zmazek (Mentor)

Abstract

V diplomskem delu 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 diplomskega dela obravnava teorijo iger. Seznanili smo se z nastankom in razvojem teorije iger, omenili znane matematike in njihove prispevke k omenjeni teoriji. Spoznali smo osnovne pojme in predpostavke teorije iger, in tako s primeri 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;diplomska dela;

Data

Language:	Slovenian
Year of publishing:	2012
Source:	Maribor
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
Publisher:	[N. Zupanc]
UDC:	51(043.2)
COBISS:	19241480
Views:	2384
Downloads:	202
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	PYLOS
Secondary 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.
Secondary keywords:	Game theory;gaames in normal form;games in extensive forms;game Pylos.;
URN:	URN:SI:UM:
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univ. v Mariboru, Fakulteta za naravoslovje in matematiko, Oddelek za matematiko in računalništvo
Pages:	68 f.
Keywords (UDC):	mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika;
ID:	20056