Login New user?  
01-Applied Mathematics & Information Sciences
An International Journal
               
 
 
 
 
 
 
 
 
 
 
 

Content
 

Volumes > Volume 9 > No. 2

 
   

Complete Solutions for a Combinatorial Puzzle in Linear Time and Its Computer Implementation

PP: 851-864
Author(s)
Daxin Zhu, Yingjie Wu, Lei Wang, Xiaodong Wang,
Abstract
In this paper we study a single player game consisting of n black checkers and m white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general n and m is nm+n+m. We have also presented an optimal algorithm to generate an optimal move sequence of the game consisting of n black checkers and m white checkers, and finally, we present an explicit solution for the general game.

  Home   About us   News   Journals   Conferences Contact us Copyright naturalspublishing.com. All Rights Reserved