SOLVING A NUMBER PLACEMENT GAME USING RECURSIVE BACKTRACKING ALGORITHM ON THE GRAPH MODEL
Sema Bodur, Sevcan Emek
Abstract
Open-access reader
Sema Bodur, Sevcan Emek
Abstract
Open-access reader
: In this study, anumber placement game has been developed. This application is designed on agraph model. Recursive backtracking algorithm was used in the solution of thisgame. Numbers on a board of nxn willbe placed in a certain order under specified rules in finite time. Withbacktracking algorithm based on depth first recursive search method, finitenumber of possible solutions has been revealed. In this application that wasinspired by 8-Queen problem, Knight’s Tour, coloring a map, Knapsack problemand other search problems, advantages and disadvantages of this method havebeen discussed. The larger the board size, the much more the number ofplacement complexity. In further studies, the solution of this problem can bepossible with the use of heuristic or informative search techniques.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
: In this study, anumber placement game has been developed. This application is designed on agraph model. Recursive backtracking algorithm was used in the solution of thisgame. Numbers on a board of nxn willbe placed in a certain order under specified rules in finite time. Withbacktracking algorithm based on depth first recursive search method, finitenumber of possible solutions has been revealed. In this application that wasinspired by 8-Queen problem, Knight’s Tour, coloring a map, Knapsack problemand other search problems, advantages and disadvantages of this method havebeen discussed. The larger the board size, the much more the number ofplacement complexity. In further studies, the solution of this problem can bepossible with the use of heuristic or informative search techniques.
Key concepts: Backtracking, Computer science, Graph, Algorithm, Mathematics, Theoretical computer science