Buro, Michael


The AIIDE 2015 Workshop Program

AI Magazine

The workshop program at the Eleventh Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment was held November 14–15, 2015 at the University of California, Santa Cruz, USA. The program included 4 workshops (one of which was a joint workshop): Artificial Intelligence in Adversarial Real-Time Games, Experimental AI in Games, Intelligent Narrative Technologies and Social Believability in Games, and Player Modeling. This article contains the reports of three of the four workshops.


Adversarial Hierarchical-Task Network Planning for Complex Real-Time Games

AAAI Conferences

Real-time strategy (RTS) games are hard from an AI point of view because they have enormous state spaces, combinatorial branching factors, allow simultaneous and durative actions, and players have very little time to choose actions. For these reasons, standard game tree search methods such as alpha- beta search or Monte Carlo Tree Search (MCTS) are not sufficient by themselves to handle these games. This paper presents an alternative approach called Adversarial Hierarchical Task Network (AHTN) planning that combines ideas from game tree search with HTN planning. We present the basic algorithm, relate it to existing adversarial hierarchical planning methods, and present new extensions for simultaneous and durative actions to handle RTS games. We also present empirical results for the μRTS game, comparing it to other state of the art search algorithms for RTS games.


Reports of the Workshops Held at the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment

AI Magazine

The AIIDE-14 Workshop program was held Friday and Saturday, October 3–4, 2014 at North Carolina State University in Raleigh, North Carolina. The workshop program included five workshops covering a wide range of topics. The titles of the workshops held Friday were Games and Natural Language Processing, and Artificial Intelligence in Adversarial Real-Time Games. The titles of the workshops held Saturday were Diversity in Games Research, Experimental Artificial Intelligence in Games, and Musical Metacreation.


Reports of the Workshops Held at the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment

AI Magazine

The AIIDE-14 Workshop program was held Friday and Saturday, October 3–4, 2014 at North Carolina State University in Raleigh, North Carolina. The workshop program included five workshops covering a wide range of topics. The titles of the workshops held Friday were Games and Natural Language Processing, and Artificial Intelligence in Adversarial Real-Time Games. The titles of the workshops held Saturday were Diversity in Games Research, Experimental Artificial Intelligence in Games, and Musical Metacreation. This article presents short summaries of those events.


The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment

AI Magazine

The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE) was held October 8-12, 2012, at Stanford University in Palo Alto, California. The conference included a research and industry track as well as a demonstration program. The conference featured 16 technical papers, 16 posters, and one demonstration, along with invited speakers, the StarCraft Ai competition, a newly-introduced Doctoral Consortium, and 5 workshops.


The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment

AI Magazine

The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE) was held October 8-12, 2012, at Stanford University in Palo Alto, California. The conference included a research and industry track as well as a demonstration program. The conference featured 16 technical papers, 16 posters, and one demonstration, along with invited speakers, the StarCraft Ai competition, a newly-introduced Doctoral Consortium, and 5 workshops. This report summarizes the activities of the conference.


Real-Time Strategy Game Competitions

AI Magazine

In recent years, real-time strategy (RTS) games have gained attention in the AI research community for their multitude of challenging and relevant real-time decision problems that have to be solved in order to win against human experts or to effectively collaborate with other players in team-games. In this article we motivate research in this area, give an overview of past RTS game AI competitions, and discuss future directions.


Fast Heuristic Search for RTS Game Combat Scenarios

AAAI Conferences

Heuristic search has been very successful in abstract game domains such as Chess and Go. In video games, however, adoption has been slow due to the fact that state and move spaces are much larger, real-time constraints are harsher, and constraints on computational resources are tighter. In this paper we present a fast search method — Alpha-Beta search for durative moves— that can defeat commonly used AI scripts in RTS game combat scenarios of up to 8 vs. 8 units running on a single core in under 5ms per search episode. This performance is achieved by using standard search enhancements such as transposition tables and iterative deepening, and novel usage of combat AI scripts for sorting moves and state evaluation via playouts. We also present evidence that commonly used combat scripts are highly exploitable — opening the door for a promising line of research on opponent combat modelling.


Incorporating Search Algorithms into RTS Game Agents

AAAI Conferences

Real-time strategy (RTS) games are known to be one of the most complex game genres for humans to play, as well as one of the most difficult games for computer AI agents to play well. To tackle the task of applying AI to RTS games, recent techniques have focused on a divide-and-conquer approach, splitting the game into strategic components, and developing separate systems to solve each. This trend gives rise to a new problem: how to tie these systems together into a functional real-time strategy game playing agent. In this paper we discuss the architecture of UAlbertaBot, our entry into the 2011/2012 StarCraft AI competitions, and the techniques used to include heuristic search based AI systems for the intelligent automation of both build order planning and unit control for combat scenarios.


Alpha-Beta Pruning for Games with Simultaneous Moves

AAAI Conferences

Alpha-Beta pruning is one of the most powerful and fundamental MiniMax search improvements. It was designed for sequential two-player zero-sum perfect information games. In this paper we introduce an Alpha-Beta-like sound pruning method for the more general class of “stacked matrix games” that allow for simultaneous moves by both players. This is accomplished by maintaining upper and lower bounds for achievable payoffs in states with simultaneous actions and dominated action pruning based on the feasibility of certain linear programs. Empirical data shows considerable savings in terms of expanded nodes compared to naive depth-first move computation without pruning.