An Optimal Algorithm for a Strategy Game
Daxin Zhu, Xiaodong Wang
Available Online August 2015.
- 10.2991/meita-15.2015.65How to use a DOI?
- strategy game, algorithm, explicit solution, optimal move.
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.
- © 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/).
Cite this article
TY - CONF AU - Daxin Zhu AU - Xiaodong Wang PY - 2015/08 DA - 2015/08 TI - An Optimal Algorithm for a Strategy Game BT - Proceedings of the 2015 International Conference on Materials Engineering and Information Technology Applications PB - Atlantis Press SP - 353 EP - 358 SN - 2352-5401 UR - https://doi.org/10.2991/meita-15.2015.65 DO - 10.2991/meita-15.2015.65 ID - Zhu2015/08 ER -