SOLVING A NUMBER PLACEMENT GAME USING RECURSIVE BACKTRACKING ALGORITHM ON THE GRAPH MODEL

Authors : Sema Bodur, Sevcan Emek

Pages : 286-291

View : 221 | Download : 1454

Publication Date : 2014-09-01

Article Type : Research Paper

Abstract :: In this study, a number placement game has been developed. This application is designed on a graph model. Recursive backtracking algorithm was used in the solution of this game. Numbers on a board of nxn will be placed in a certain order under specified rules in finite time. With backtracking algorithm based on depth first recursive search method, finite number of possible solutions has been revealed. In this application that was inspired by 8-Queen problem, Knight’s Tour, coloring a map, Knapsack problem and other search problems, advantages and disadvantages of this method have been discussed. The larger the board size, the much more the number of placement complexity. In further studies, the solution of this problem can be possible with the use of heuristic or informative search techniques. 
Keywords : Backtracking, graph, depth first search algorithm