Year: 2024
Type: conference-paper
Abstract: The Nim game is a fundamental example in combinatorial game theory, exemplifying impartial games where moves depend solely on the current position. Creating difficulty levels in Nim for computer play presents challenges, as small changes in game element positioning can significantly alter the game’s difficulty. Initial ideas, such as randomly applying the winning formula or ensuring constant computer wins, but it proved unsatisfactory due to erratic or discouraging gameplay. This article proposes using Genetic Algorithms (GAs) to develop varied difficulty levels in Nim. Our approach avoids the established winning formula, making defining an independent fitness function complex. Instead, we employ a competitive coevolutionary fitness function, where individuals are evaluated against each other, allowing the fitness criteria to evolve with the population. This method produces more nuanced and engaging difficulty levels, enhancing player experience through a balanced and evolving challenge.
Authors: Matheus Peres, Francisco Henrique de Freitas Viana, Kennedy M. Fernandes, Pedro Henrique Gonzalez, Leandro de M. B. Soares, Eduardo Bezarra, Joel Andre F. dos Santos, Diego Brandão
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Awards: G1840770272, G2311368543
OpenAlex ID: W4406034285