Kombinatorična teorija iger

Babič, Nejc

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Kombinatorična teorija iger
Authors:	ID Babič, Nejc (Author) ID Brešar, Boštjan (Mentor) More about this mentor...
Files:	MAG_Babic_Nejc_2018.pdf (2,78 MB) MD5: 18223AFC7BC633C7BB11EBF4E52AED19 PID: 20.500.12556/dkum/360a8f90-1eae-4a98-bd83-cf06d5ac1012
Language:	Slovenian
Work type:	Master's thesis/paper
Typology:	2.09 - Master's Thesis
Organization:	FNM - Faculty of Natural Sciences and Mathematics
Abstract:	V magistrskem delu obravnavamo izbrane vsebine s področja kombinatorične teorije iger. V uvodnih poglavjih predstavimo primere preprostih kombinatoričnih iger ter navedemo nekatere osnovne definicije in trditve, na katerih temelji teorija kombinatoričnih iger. Predstavimo dokaz Zermelovega izreka in podamo več primerov osnovnih strategij, ki jih igralca uporabljata pri igranju. Glavni poudarek je na igrah normalnega tipa, pri katerih zmaga tisti igralec, ki napravi zadnjo potezo. Ob tem obravnavamo pojme kot so: položaj in njegov tip, vsota položajev in ekvivalenca položajev, na katerih temelji kombinatorična teorija iger. V drugem delu predstavimo kombinatorično teorijo nepristranskih iger ob pomoči igre Nim in dokažemo Sprague-Grundyev izrek, ki nam omogoča celostno razumevanje ekvivalence pri nepristranskih igrah. Podobno predstavimo tudi njegovo različico za pristranske igre ob pomoči igre Hackenbush. Skozi celotno magistrsko delo povezujemo in odkrivamo zveze med obravnavanimi vsebinami, ki jih dopolnjujemo z rešenimi praktičnimi primeri.
Keywords:	Zermelov izrek, strategije, igre normalnega tipa, nepristranske in pristranske igre, Sprague-Grundyev izrek.
Place of publishing:	Maribor
Publisher:	[N. Babič]
Year of publishing:	2018
PID:	20.500.12556/DKUM-72798
UDC:	519.83(043.2)
COBISS.SI-ID:	24266504
NUK URN:	URN:SI:UM:DK:CIWCV5DQ
Publication date in DKUM:	08.01.2019
Views:	2149
Downloads:	195
Metadata:
Categories:	FNM
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

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

Licences

License:	CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Link:	http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:	The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:	19.11.2018

Secondary language

Language:	English
Title:	Combinatorial game theory
Abstract:	In this master's thesis, we discuss chosen topics of combinatorial game theory. In the opening section we introduce some simple combinatorial games and give some basic definitions and theorems on which the theory of combinatorial games is based. We present a proof of Zermelo's theorem, and provide some examples of basic strategies that can be used by players while playing. The main emphasis is on the normal-play games, in which the player that makes the last move wins. Along the way we study the conccepts such as position in the game and its type, sum of positions and equivalence of positions, on which the combinatorial game theory is based. In the second part we present combinatorial theory of impartial games with the help of the Nim game. We prove the Sprague-Grundy's theorem, which enables us to comprehensively understand the equivalence in impartial games. Similarly, we also present a version for partizan games with the help of the Hackenbush game. Through the entire master's thesis, we connect and discover the relations between the discussed contents, which are supplemented with the solved practical examples.
Keywords:	Zermelo's Theorem, strategies, normal-play games, impartial and partizan games, Sprague-Grundy's theorem.

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back