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 116
- Downloads 0
LTE Performance over Wimax in Term of Network Applications: An Implementation on E-Administration System
Today's application are based on the network as the main communication mediums for interconnecting between its peers. From this term, the importance of the network increased rapidly as the raise of technology and applica...
Review on Comment Volume Prediction
Abstract: In this paper we present the concept of social media and its various functional building blocks. Social media has become an ubiquitous part of social networking and content sharing. Social media make use of mob...
Longest Common Subsequence: A Method for Automatic Evaluation of Handwritten Essays
Abstract Essays are used to evalaute student’s knowledge from early before itself. The aim of the proposed system is to evalaute the handwritten essays automatically. The proposed method is to develope an automated syste...
Interfacing and Analysis of GPS data using VB
Abstract: Global Positioning System (GPS) provides location and time information anywhere on the earth. We can utilize GPS data to create new applications that can be very useful nowadays. If we want to build a new appli...
Impulsion of Mining Paradigm with Density Based Clustering of Multi Dimensional Spatial Data
Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging fr...