DROPS

Document

Search in Real-Time Video Games

Authors: Peter I. Cowling, Michael Buro, Michal Bida, Adi Botea, Bruno Bouzy, Martin V. Butz, Philip Hingston, Hector Muñoz-Avila, Dana Nau, and Moshe Sipper

Published in: Dagstuhl Follow-Ups, Volume 6, Artificial and Computational Intelligence in Games (2013)

Abstract

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.

Cite as

Peter I. Cowling, Michael Buro, Michal Bida, Adi Botea, Bruno Bouzy, Martin V. Butz, Philip Hingston, Hector Muñoz-Avila, Dana Nau, and Moshe Sipper. Search in Real-Time Video Games. In Artificial and Computational Intelligence in Games. Dagstuhl Follow-Ups, Volume 6, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InCollection{cowling_et_al:DFU.Vol6.12191.1,
  author =	{Cowling, Peter I. and Buro, Michael and Bida, Michal and Botea, Adi and Bouzy, Bruno and Butz, Martin V. and Hingston, Philip and Mu\~{n}oz-Avila, Hector and Nau, Dana and Sipper, Moshe},
  title =	{{Search in Real-Time Video Games}},
  booktitle =	{Artificial and Computational Intelligence in Games},
  pages =	{1--19},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-62-0},
  ISSN =	{1868-8977},
  year =	{2013},
  volume =	{6},
  editor =	{Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol6.12191.1},
  URN =		{urn:nbn:de:0030-drops-43328},
  doi =		{10.4230/DFU.Vol6.12191.1},
  annote =	{Keywords: search algorithms, real-time video games, Monte Carlo tree search, minimax search, game theory}
}

Document

DOI: 10.4230/DFU.Vol6.12191.21

Pathfinding in Games

Authors: Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, and Dana Nau

Published in: Dagstuhl Follow-Ups, Volume 6, Artificial and Computational Intelligence in Games (2013)

Abstract

Commercial games can be an excellent testbed to artificial intelligence (AI) research, being a middle ground between synthetic, highly abstracted academic benchmarks, and more intricate problems from real life. Among the many AI techniques and problems relevant to games, such as learning, planning, and natural language processing, pathfinding stands out as one of the most common applications of AI research to games. In this document we survey recent work in pathfinding in games. Then we identify some challenges and potential directions for future work. This chapter summarizes the discussions held in the pathfinding workgroup.

Cite as

Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, and Dana Nau. Pathfinding in Games. In Artificial and Computational Intelligence in Games. Dagstuhl Follow-Ups, Volume 6, pp. 21-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InCollection{botea_et_al:DFU.Vol6.12191.21,
  author =	{Botea, Adi and Bouzy, Bruno and Buro, Michael and Bauckhage, Christian and Nau, Dana},
  title =	{{Pathfinding in Games}},
  booktitle =	{Artificial and Computational Intelligence in Games},
  pages =	{21--31},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-62-0},
  ISSN =	{1868-8977},
  year =	{2013},
  volume =	{6},
  editor =	{Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol6.12191.21},
  URN =		{urn:nbn:de:0030-drops-43334},
  doi =		{10.4230/DFU.Vol6.12191.21},
  annote =	{Keywords: path finding, search, games}
}

Search Results

Documents authored by Bouzy, Bruno

Search in Real-Time Video Games

Abstract

Cite as

Pathfinding in Games

Abstract

Cite as

Thanks for your feedback!

Could not send message