An Optimal Algorithm for a Strategy Game
Daxin Zhu, Xiaodong Wang · 2015
A single player strategy game is studied in this paper.We are interested in algorithms which, given integer n, generate the corresponding move sequences to reach the final state of the game with smallest number of steps.In this paper we present an optimal algorithm to generate an optimal move sequence of the game consisting of n black checkers and n white checkers, and finally, we present an explicit solution for the general game of size n.