Evolving interpretable strategies for zero-sum games

Author(s)

Marino, Julian R. H. ; Toledo, Claudio F. M.

• Document type: Journal article
• Source: APPLIED SOFT COMPUTING; v. 122, p. 11-pg., 2022-05-07.

Abstract

The present paper introduces Gesy, a genetic programming approach to script synthesis for zero-sum games. We will explore the sum-zero game context in Real-Time Strategy (RTS) games, where players must look for strategies (planning of actions) to maximize their gains or minimize their losses. The goal is to solve the script synthesis problem, which demands the synthesis of a computer program from a space of programs defined by a Domain-Specific Language (DSL). The synthesized program must encode a practical strategy for zero-sum games. Empirical results validate Gesy using the mu RTS platform, an academic test bed game that presents the main features found in RTS commercial games. The results show that our method provides interpretable strategies that are competitive with state-of-the-art search-based approaches in terms of play strength. Moreover, once synthesized, scripts require only a tiny fraction of the time needed by search-based methods to decide on the agent's next action. (c) 2022 Elsevier B.V. All rights reserved. (AU)

• FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
• Grantee: Francisco Louzada Neto
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC