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

8 2

Authors

  • Sema BODUR
  • Sevcan EMEK

Keywords:

Backtracking, graph, depth-first search algorithm

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

Downloads

Published

2014-09-01

How to Cite

BODUR, S., & EMEK, S. (2014). SOLVING A NUMBER PLACEMENT GAME USING RECURSIVE BACKTRACKING ALGORITHM ON THE GRAPH MODEL. The Eurasia Proceedings of Educational and Social Sciences, 1, 286–291. Retrieved from https://epess.net/index.php/epess/article/view/45

Issue

Vol. 1 (2014)

Section

Articles

License

Copyright (c) 2014 The Eurasia Proceedings of Educational and Social Sciences

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

The articles may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. Authors alone are responsible for the contents of their articles. The journal owns the copyright of the articles. The publisher shall not be liable for any loss, actions, claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of the research material. All authors are requested to disclose any actual or potential conflict of interest including any financial, personal or other relationships with other people or organizations regarding the submitted work.