Solving strategy board games using a CSP-based ACO approach. (2017)

• Record Type: Journal Article
• Authors: Gonzalez-Pardo, Antonio; Ser, Javier Del; Camacho, David
• Is Part Of: International journal of bio-inspired computation. Volume 10:Number 2(2017)
• Page Start: 136
• Page End: 144
• Publication Date: 2017
• Subjects: ant colony optimisation -- pheromone control -- strategy board games -- N-Queens problem -- oblivion rate; Biologically-inspired computing -- Periodicals; Computational biology -- Periodicals; 572.0285
• Languages: English
• ISSNs: 1758-0366

Abstract

In the last years, there have been a huge increase in the number of research contributions that use games and video-games as an application domain for testing different artificial intelligence algorithms. Some of these problems can be represented as a constraint satisfaction problem (CSP), and heuristics algorithms (such as ant colony optimisation) can be used due to the complexity of the modelled problems. This paper presents a comparative study of the performance of a novel ACO model for CSP-based board games. In this work, two different oblivion rate meta-heuristics for controlling the number of pheromones created in the model have been created. Experimental results reveal that both meta-heuristics reduce considerably the number of pheromones produced in the system without affecting the quality of the solutions in terms of average optimality.