An Algorithmic Analysis of a Combinatorial Game
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. We present also an explicit solution for the general game. This explicit solution will give the exact actions for each number of moves in constant time. The step by step process used to solve the problem is reflective of the process an expert goes through when solving the problem.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.