An algorithm for the shifting checkers problem

DOI

10.2991/icimm-15.2015.170How to use a DOI?

Keywords

Moving Checkers; optimal algorithm; Fibonacci number

Abstract

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.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Daxin Zhu
AU  - Xiaodong Wang
PY  - 2015/07
DA  - 2015/07
TI  - An algorithm for the shifting checkers problem
BT  - Proceedings of the 5th International Conference on Information Engineering for Mechanics and Materials
PB  - Atlantis Press
SP  - 931
EP  - 936
SN  - 2352-5401
UR  - https://doi.org/10.2991/icimm-15.2015.170
DO  - 10.2991/icimm-15.2015.170
ID  - Zhu2015/07
ER  -