Volume & Issue no: Volume 4, Issue 5(2), September - October 2015
____________________________________________________________________________________________________
Title: |
Study Of Brute Force and Heuristic Approach to solve sodoku |
Author Name: |
Taruna Kumari, Preeti Yadav, Lavina |
Abstract: |
Abstract
Couple of decades back, there was a tremendous development
in the field of algorithms, which were aimed at finding
efficient solutions for widespread applications. The benefits of
these algorithms were observed in their optimality and
simplicity with speed. In the last decade, solving the Sudoku
puzzle has become every one’s passion. The simplicity of
puzzle’s structure and the low requirement of mathematical
skills caused people to have enormous interest in accepting
challenges to solve the puzzle. Therefore, developers have
tried to find algorithms in order to generate the variety of
puzzles for human players so that they could be even solved by
computer programming. Many of the algorithms were
readdressed to solve the problem of finding solution of
Sudoku. In this paper, we have applied backtracking, a brute
force approach and rule based, a heuristic approach to solve
Sudoku.
Keyword: Backtracking, Brute-Force, Heuristic, Rule-
Based. |
Cite this article: |
Taruna Kumari, Preeti Yadav, Lavina , "
Study Of Brute Force and Heuristic Approach to solve sodoku" , International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) ,
Volume 4, Issue 5(2), September - October 2015 , pp.
052-055 , ISSN 2278-6856.
|
Full Text [PDF] Back to Current Issue |
NOTE: Authors note that paper cannot be withdrawn at any condition once it is accepted. The Team of IJETTCS advise you, do not submit same article to the multiple journals simultaneously. This may create a problem for you. Please wait for review report which will take maximum 01 to 02 week.