A Comparative Study On The Performance CharacteristicsOf Sudoku Solving Algorithms
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 5
Abstract
Abstract:Solving Sudoku, a NP-Complete combinatorial optimization problem has been carried out using the optimized Graph Referencing Algorithm (GRA),Genetic Algorithm (GA), Simulated Annealing (SA), Harmony Search (HS) and Brute Force algorithm. The present study is primarily aimed at finding out the fastestalgorithm in terms of least time consumption in solving Sudoku. The performance characteristics of algorithms of interest are studied by deploying randomly selected puzzles with different difficulty levels. The comparative performance characteristics study reveals the superiority of the Graph Referencing algorithm over the other algorithms in taking least possible time to solve Sudoku.
Authors and Affiliations
Sankhadeep Chatterjee, , Saubhik Paladhi, , Raktim Chakraborty
Keywords
Related Articles
- EP ID EP121657
- DOI -
- Views 112
- Downloads 0
Efficient Detection of Internet Worms Using Data Mining Techniques
Internet worms pose a serious threat to computer security.Traditional approaches using signatures to detect worms pose little danger to the zero day attacks. The focus of malware research is shifting from using signature...
Congestion Control: A Dynamic Approach
Abstract: Congestion control is a very important concept used in practical networks. Congestion of a networkoccurs when a network carries such high traffic of data that the quality of service deteriorates. In moder...
Privacy and Security in Data Storage Using Two Layer Encryption and MAC Verification
Abstract: For the privacy and security of data stored in data storage a new Two Layer Encryption (TLE) approach is developed. This technique performs an encryption at two layers based on some ACP(Access Control Pol...
Protecting Attribute Disclosure for High Dimensionality and Preserving Publishing of Microdata
: Generalization and Bucketization, have been designed for privacy preserving microdata publishing. Recent work has shown that generalization loses considerable amount of information, especially for high-dimen...
Dendritic Cell Algorithm and Dempster Belief Theory Based Approach for Intrusion Detection System
Abstract: Everyone knows the services of the Internet. Internet services contain large scale of data. Security is one of the important issues during transmission of data over the network. To avoid misuse of data an...