Recursive Backtracking for Solving 9*9 Sudoku Puzzle
Journal Title: Bonfring International Journal of Data Mining - Year 2016, Vol 6, Issue 1
Abstract
Nowadays Sudoku is a very popular game throughout the world and it appears in different medias, including websites, newspapers and books. There are numerous methods or algorithms to find Sudoku solutions and Sudoku generating algorithms. This paper explains possible number of valid grids in a 9*9 sudoku and developed a programming approach for solving a 9*9 sudoku puzzle and the results have been analysed in accordance with various number of clues for 9*9 sudoku.
Authors and Affiliations
Dhanya Job , Varghese Paul
Keywords
Related Articles
- EP ID EP149189
- DOI 10.9756/BIJDM.8128
- Views 90
- Downloads 0
Improving Efficiency of Apriori Algorithms for Sequential Pattern Mining
Computer Systems are exposed to an increasing number of different types of security threats due to the expanding of internet in recent years. How to detect network intrusions effectively becomes an important security tec...
Consensus Clustering for Microarray Gene Expression Data
Cluster analysis in microarray gene expression studies is used to find groups of correlated and co-regulated genes. Several clustering algorithms are available in the literature. However no single algorithm is optimal fo...
Comparison of Estimators of Gumbel Distribution for Modelling Wind Speed Data
Estimation of extreme wind speed potential at a region is of importance while designing tall structures such as cooling towers, stacks, transmission line towers, etc. Assessment of wind speed in a region can expediently...
Factorial Dimensions of Employee Engagement in Public and Private Sector Banks
Employee engagement is the level of commitment and involvement an employee has towards his organization and its values. An engaged employee is aware of business context, and works with colleagues to improve performance w...