Logo des Repositoriums
 

Adversarial N-player Search using Locality for the Game of Battlesnake

dc.contributor.authorSchier, Maximilian Benedikt
dc.contributor.authorWüstenbecker, Niclas
dc.contributor.editorBecker, Michael
dc.date.accessioned2019-10-14T12:09:13Z
dc.date.available2019-10-14T12:09:13Z
dc.date.issued2019
dc.description.abstractThis paper presents an approach to designing a planning agent for simultaneous N-player games. We propose to reduce the complexity of such games by limiting the search to players in the locality of the acting agent. For Battlesnake, the game at hand, an iterative deepening search strategy utilizing both alpha-beta and max^n search is suggested. Useful metrics for estimating player advantage are presented, especially using a diamond flood filler for measuring board control. Furthermore, the process of our heuristic parameter tuning with a grid search and a genetic algorithm is described. We provide a qualitative analysis of our algorithm's performance at the international artificial intelligence competition Battlesnake, Victoria. Here, our agent placed second in the intermediate division.en
dc.identifier.isbn978-3-88579-449-3
dc.identifier.pissn1614-3213
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/29001
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSKILL 2019 - Studierendenkonferenz Informatik
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Seminars, Volume S-15
dc.subjectGame Tree Search
dc.subjectArtificial Intelligence
dc.subjectN-player Game
dc.subjectmax^n
dc.subjectBattlesnake
dc.titleAdversarial N-player Search using Locality for the Game of Battlesnakeen
dc.typeText/Conference Paper
gi.citation.endPage120
gi.citation.publisherPlaceBonn
gi.citation.startPage109
gi.conference.date25.-26. September 2019
gi.conference.locationKassel
gi.conference.sessiontitleAlgorithmik

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
SKILL2019-09.pdf
Größe:
238.35 KB
Format:
Adobe Portable Document Format