2014DergiPark (Istanbul University)Open access

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

Sema Bodur, Sevcan Emek

Open full text 0 citations

Abstract

: 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.

Open-access reader

About this research paper

What this paper is about

: 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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

: 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

Related papers

Back to paper searchBrowse research topicsOriginal source
SOLVING A NUMBER PLACEMENT GAME USING RECURSIVE BACKTRACKING ALGORITHM ON THE GRAPH MODEL — Research Paper | ScholarLens