TotalBotWar: A New Pseudo Real-time Multi-action Game Challenge and Competition for AI

• URL: http://arxiv.org/abs/2009.08696v1
• Date: Fri, 18 Sep 2020 09:13:56 GMT
• Title: TotalBotWar: A New Pseudo Real-time Multi-action Game Challenge and Competition for AI
• Authors: Alejandro Estaben, C\'esar D\'iaz, Raul Montoliu, Diego P\'erez-Liebana
• Abstract summary: TotalBotWar is a new pseudo real-time multi-action challenge for game AI. The game is based on the popular TotalWar games series where players manage an army to defeat the opponent's one.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents TotalBotWar, a new pseudo real-time multi-action challenge for game AI, as well as some initial experiments that benchmark the framework with different agents. The game is based on the real-time battles of the popular TotalWar games series where players manage an army to defeat the opponent's one. In the proposed game, a turn consists of a set of orders to control the units. The number and specific orders that can be performed in a turn vary during the progression of the game. One interesting feature of the game is that if a particular unit does not receive an order in a turn, it will continue performing the action specified in a previous turn. The turn-wise branching factor becomes overwhelming for traditional algorithms and the partial observability of the game state makes the proposed game an interesting platform to test modern AI algorithms.

Related papers

• DanZero+: Dominating the GuanDan Game through Reinforcement Learning [95.90682269990705]
  We develop an AI program for an exceptionally complex and popular card game called GuanDan. We first put forward an AI program named DanZero for this game. In order to further enhance the AI's capabilities, we apply policy-based reinforcement learning algorithm to GuanDan.
  arXiv  Detail & Related papers  (2023-12-05T08:07:32Z)
• Introducing Tales of Tribute AI Competition [0.7639610349097472]
  This paper presents a new AI challenge, the Tales of Tribute AI Competition (TOTAIC) It is based on a two-player deck-building card game released with the High Isle chapter of The Elder Scrolls Online. This paper introduces the competition framework, describes the rules of the game, and presents the results of a tournament between sample AI agents.
  arXiv  Detail & Related papers  (2023-05-14T19:55:56Z)
• Are AlphaZero-like Agents Robust to Adversarial Perturbations? [73.13944217915089]
  AlphaZero (AZ) has demonstrated that neural-network-based Go AIs can surpass human performance by a large margin. We ask whether adversarial states exist for Go AIs that may lead them to play surprisingly wrong actions. We develop the first adversarial attack on Go AIs that can efficiently search for adversarial states by strategically reducing the search space.
  arXiv  Detail & Related papers  (2022-11-07T18:43:25Z)
• Keke AI Competition: Solving puzzle levels in a dynamically changing mechanic space [5.2508303190856624]
  The Keke AI Competition introduces an artificial agent competition for the game Baba is You. The paper describes the framework and evaluation metrics used to rank submitted agents.
  arXiv  Detail & Related papers  (2022-09-11T17:50:27Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• On the Power of Refined Skat Selection [1.3706331473063877]
  Skat is a fascinating card game, show-casing many of the intrinsic challenges for modern AI systems. We propose hard expert-rules and a scoring function based on refined skat evaluation features. Experiments emphasize the impact of the refined skat putting algorithm on the playing performance of the bots.
  arXiv  Detail & Related papers  (2021-04-07T08:54:58Z)
• Collaborative Agent Gameplay in the Pandemic Board Game [3.223284371460913]
  Pandemic is an exemplar collaborative board game where all players coordinate to overcome challenges posed by events occurring during the game's progression. This paper proposes an artificial agent which controls all players' actions and balances chances of winning versus risk of losing in this highly Evolutionary environment. Results show that the proposed algorithm can find winning strategies more consistently in different games of varying difficulty.
  arXiv  Detail & Related papers  (2021-03-21T13:18:20Z)
• AI and Wargaming [7.946510318969309]
  We review the current state-of-the-art through the lens of wargaming. We ask firstly what features of wargames distinguish them from the usual AI testbeds, and secondly which recent AI advances are best suited to address these wargame-specific features.
  arXiv  Detail & Related papers  (2020-09-18T16:39:54Z)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Efficient exploration of zero-sum stochastic games [83.28949556413717]
  We investigate the increasingly important and common game-solving setting where we do not have an explicit description of the game but only oracle access to it through gameplay. During a limited-duration learning phase, the algorithm can control the actions of both players in order to try to learn the game and how to play it well. Our motivation is to quickly learn strategies that have low exploitability in situations where evaluating the payoffs of a queried strategy profile is costly.
  arXiv  Detail & Related papers  (2020-02-24T20:30:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.