Search in Real-Time Video Games

Medientyp: Elektronischer Konferenzbericht

Titel: Search in Real-Time Video Games

Beteiligte: Cowling, Peter I. [VerfasserIn]; Buro, Michael [VerfasserIn]; Bida, Michal [VerfasserIn]; Botea, Adi [VerfasserIn]; Bouzy, Bruno [VerfasserIn]; Butz, Martin V. [VerfasserIn]; Hingston, Philip [VerfasserIn]; Nau, Dana [VerfasserIn]; Sipper, Moshe [VerfasserIn]

Erschienen: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; Dagstuhl Follow-Ups. Artificial and Computational Intelligence in Games, 2013

Sprache: Englisch

DOI: https://doi.org/10.4230/DFU.Vol6.12191.1

Schlagwörter: real-time video games ; game theory ; search algorithms ; minimax search ; Monte Carlo tree search ; Data processing Computer science

Entstehung:

Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.

Beschreibung: This chapter arises from the discussions of an experienced international group of researchers interested in the potential for creative application of algorithms for searching finite discrete graphs, which have been highly successful in a wide range of application areas, to address a broad range of problems arising in video games. The chapter first summarises the state of the art in search algorithms for games. It then considers the challenges in implementing these algorithms in video games (particularly real time strategy and first-person games) and ways of creating searchable discrete representations of video game decisions (for example as state-action graphs). Finally the chapter looks forward to promising techniques which might bring some of the success achieved in games such as Go and Chess, to real-time video games. For simplicity, we will consider primarily the objective of maximising playing strength, and consider games where this is a challenging task, which results in interesting gameplay.

Zugangsstatus: Freier Zugang

Rechte-/Nutzungshinweise: Namensnennung (CC BY)

Nur in Feld suchen:

Zuletzt gesuchte Begriffe: