Leveraging parallel architectures in AI search algorithms for games

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This document contains a summary of research performed by the author on the topic of search algorithms for games. An outline of the problems being addressed is provided, along with the progress already made, and planned future work. The specific subjects studied are: parallelizing UCT search on GPUs, the development of a hierarchical search framework for Real-Time Strategy (RTS) games and the building placement problem in RTS games. We propose to take advantage of different parallel architectures to help solve these problems.

Cite

CITATION STYLE

APA

Barriga, N. A. (2014). Leveraging parallel architectures in AI search algorithms for games. In AAAI Workshop - Technical Report (Vol. WS-14-19, pp. 2–5). AI Access Foundation. https://doi.org/10.1609/aiide.v10i6.12693

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free