N-Tuple Network Search in Othello Using Genetic Algorithms
As one of the strongest Othello agents, Edax employs an n-tuple network to evaluate the board, with points of interest represented as tuples. However, this network maintains a constant shape throughout the game, whereas the points of interest in Othello vary with respect to game’s progress. The present study was conducted to optimize the shape of the n-tuple network using a genetic algorithm to maximize final score prediction accuracy for a certain number of moves. We selected shapes for 18-, 22-, 26-, 30-, 34-, 38-, 42-, and 46-move configurations, and constructed an agent that appropriately shapes an n-tuple network depending on the progress of the game. Consequently, agents using the n-tuple network developed in this study exhibited a winning rate of 75%. This method is independent of game characteristics and can optimize the shape of larger (or smaller) N-tuple networks.
Authors
- Kaiyu Suzuki (ORCID: https://orcid.org/0000-0002-2875-7430)
- Tomofumi Matsuzawa (ORCID: https://orcid.org/0000-0001-7036-0042)
- Hiroto Kuramitsu
Institutions
- Tokyo University of Information Sciences (JP)
- Tokyo University of Science (JP)
Publication Details
- Journal
- Games
- Published
- 2025-01-09
- DOI
- https://doi.org/10.3390/g16010005
- Citations
- 1
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 2.48