An algorithm for the shifting checkers problem
Daxin Zhu, Xiaodong Wang · Advances in engineering research/Advances in Engineering Research · 2015
In this paper, we study Moving Checkers Game, an interesting shifting checkers game consisting of n black checkers and 1 white checkers.We have proved that the minimum number of steps needed to play the game for general n is 2n+1.We have also presented an optimal algorithm to generate all of the optimal solutions in linear time for very large size.The number of solutions for the game of size n is the (n+2)th Fibonacci number.