Real-Time Strategy Games
22 papers with code • 0 benchmarks • 4 datasets
Real-Time Strategy (RTS) tasks involve training an agent to play video games with continuous gameplay and high-level macro-strategic goals such as map control, economic superiority and more.
( Image credit: Multi-platform Version of StarCraft: Brood War in a Docker Container )
These leaderboards are used to track progress in Real-Time Strategy Games
Finally, we present initial baseline results for canonical deep reinforcement learning agents applied to the StarCraft II domain.
Both TStarBot1 and TStarBot2 are able to defeat the built-in AI agents from level 1 to level 10 in a full game (1v1 Zerg-vs-Zerg game on the AbyssalReef map), noting that level 8, level 9, and level 10 are cheating agents with unfair advantages such as full vision on the whole map and resource harvest boosting.
Collection and Validation of Psychophysiological Data from Professional and Amateur Players: a Multimodal eSports Dataset
An important feature of the dataset is simultaneous data collection from five players, which facilitates the analysis of sensor data on a team level.
Gym-$μ$RTS: Toward Affordable Full Game Real-time Strategy Games Research with Deep Reinforcement Learning
In recent years, researchers have achieved great success in applying Deep Reinforcement Learning (DRL) algorithms to Real-time Strategy (RTS) games, creating strong autonomous agents that could defeat professional players in StarCraft~II.
We present TorchCraft, a library that enables deep learning research on Real-Time Strategy (RTS) games such as StarCraft: Brood War, by making it easier to control these games from a machine learning framework, here Torch.
In addition, our platform is flexible in terms of environment-agent communication topologies, choices of RL methods, changes in game parameters, and can host existing C/C++-based game environments like Arcade Learning Environment.
In recent years, Deep Reinforcement Learning (DRL) algorithms have achieved state-of-the-art performance in many challenging strategy games.
Game tree search algorithms such as minimax have been used with enormous success in turn-based adversarial games such as Chess or Checkers.