Solving strategy board games using a CSP-based ACO approach

No Thumbnail Available
Identifiers
URI: https://hdl.handle.net/11556/4081
ISSN: 1758-0366
DOI: 10.1504/IJBIC.2017.085892
Publication date
2017
Authors
Advisors
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
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.
Description
Publisher Copyright: Copyright © 2017 Inderscience Enterprises Ltd.
Keywords
Ant Colony Optimisation , N-Queens Problem , Oblivion Rate , Pheromone Control , Strategy Board Games , Theoretical Computer Science , General Computer Science
Type
journal article
Citation
Gonzalez-Pardo , A , Ser , J D & Camacho , D 2017 , ' Solving strategy board games using a CSP-based ACO approach ' , International Journal of Bio-Inspired Computation , vol. 10 , no. 2 , pp. 136-144 . https://doi.org/10.1504/IJBIC.2017.085892