Evolving heuristic based game playing strategies for checkers incorporating reinforcement learning

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The research presented in this paper forms part of a larger initiative aimed at creating a general game player for two player zero sum board games. In previous work, we have presented a novel heuristic based genetic programming approach for evolving game playing for the board game Othello. This study extends this work by firstly evaluating it on a different board game, namely, checkers. Secondly, the study investigates incorporating reinforcement learning to further improve evolved game playing strategies. Genetic programming evolves game playing strategies composed of heuristics, which are used to decide which move to make next. Each strategy represents a player. A separate genetic programming run is performed for each move of the game. Reinforcement learning is applied to the population at the end of a run to further improve the evolved strategies. The evolved players were found to outperform random players at checkers. Furthermore, players induced combining genetic programming and reinforcement learning outperformed the genetic programming players. Future research will look at further application of this approach to similar non-trivial board games such as chess.

Cite

CITATION STYLE

APA

Frankland, C., & Pillay, N. (2016). Evolving heuristic based game playing strategies for checkers incorporating reinforcement learning. In Advances in Intelligent Systems and Computing (Vol. 419, pp. 165–178). Springer Verlag. https://doi.org/10.1007/978-3-319-27400-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free