izpis_h1_title_alt

Algoritmi za igranje potezne večakcijske miselne igre Less
MAGERL, ŽAN (Author), Mihelič, Jurij (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (384,76 KB)
MD5: 4133C3446424B0983747693B8FF1520F

Abstract
V tem delu predstavimo izvedbo in rezultate različnih algoritmov in metod za igranje večakcijske igre Less. Uporabili smo minimaks algoritem, njegovo optimizacijo z alfa-beta rezanjem in drevesno preiskovanje Monte-Carlo. Vse algoritme smo med seboj pomerili v dvobojih in nato analizirali rezultate in vpliv različnih vrednosti vhodnih parametrov algoritmov. Zaradi velikega vejitvenega faktorja igre Less se je drevesno preiskovanje Monte-Carlo izkazalo kot primernejše za igranje igre od minimaks algoritma. V nadaljni analizi smo ugotovili, da na izide iger ne vpliva prednost prve poteze, močno pa vpliva začetna postavitev igralnega polja. Rezultati so pokazali, da najboljši zasnovani algoritmi premagajo priložnostnega igralca igre Less.

Language:Slovenian
Keywords:algoritem minimaks, alfa-beta rezanje, drevesno preiskovanje Monte-Carlo, analiza, evalvacijska funkcija, igra Less
Work type:Bachelor thesis/paper (mb11)
Organization:FRI - Faculty of computer and information science
Year:2020
COBISS.SI-ID:28907779 This link opens in a new window
Views:375
Downloads:117
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Secondary language

Language:English
Title:Algorithms for playing turn-based multi-action mind game Less
Abstract:
In this thesis we present implementation and results from different algorithms and methods for playing multi-action game Less. We have used minimax algorithm, its optimization with alpha-beta pruning and Monte-Carlo tree search. All algorithms have played games between themselves and then we have analyzed results and the influence of different input parameters. Due to the huge branching factor of game Less, the Monte-Carlo tree search has proven to be better choice than minimax algorithm. In the following analysis we have discovered, that the first move advantage does not play role in the outcome of the game, while the initial setting of the tiles does. Results have shown that best designed algorithms can beat occasional player of game Less.

Keywords:algorithm minimax, alpha-beta pruning, Monte-Carlo tree search, analysis, evaluation function, game Less

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Comments

Leave comment

You have to log in to leave a comment.

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

Back