We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Study on the Performance Characteristics of Sudoku Solving Algorithms

by Akta Agrawal, Padma Bonde
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 1
Year of Publication: 2015
Authors: Akta Agrawal, Padma Bonde
10.5120/21663-4732

Akta Agrawal, Padma Bonde . Study on the Performance Characteristics of Sudoku Solving Algorithms. International Journal of Computer Applications. 122, 1 ( July 2015), 10-12. DOI=10.5120/21663-4732

@article{ 10.5120/21663-4732,
author = { Akta Agrawal, Padma Bonde },
title = { Study on the Performance Characteristics of Sudoku Solving Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 1 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 10-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume122/number1/21663-4732/ },
doi = { 10.5120/21663-4732 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:09:56.538313+05:30
%A Akta Agrawal
%A Padma Bonde
%T Study on the Performance Characteristics of Sudoku Solving Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 1
%P 10-12
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Sudoku is a logic-based puzzle that is played by numbers from 1 to 9. The simplicity of puzzle's structure and low requirement of mathematical skills caused people to have enormous interest in accepting challenges to solve the puzzle . It is therefore of interest to study how to solve ,generate and rate such puzzles by the help of computer algorithms. This research, is carried out on limited to study of two chosen algorithm with their pros , cons and pseudo code . Paper also concluded to study further the result of testing, examine comparison, with level of puzzles and time complexity between algorithms. [1,2]

References
  1. Knuth, Donald (1997). Fundamental Algorithms, Third Edition,ISBN 0-201-89683-4.
  2. Ch. X u , W. X u ,2009, The model and algorithm to Estimate The Difficulty Levels of Sudoku puzzles, Journals of Mathematicsv Research. .
  3. Lewis,R,Meta heuristics, 2007, Can solve Sudoku puzzles . Journal of heuristics,13(4),387-401.
  4. Xu,J, 2009, Using backtracking method to solve Sudoku puzzle, computer programming skills & maintainence 5,pp 17-21.
  5. Chakraborty ,r,Palidhi, S,Banerjee,, 2014, An optimized Algorithm for solving combinatorial probl;em using reference graph IOSR Journal of CS 16(3PP1-7
  6. Darwin , c, 1859, The origin of species Oxford University.
  7. Mantere T Kolljonen solving rating & generating Sudoku with GA,Proc. of IEEE 1382-1389
  8. Geem,Zong WOO, 2007, Harmony search algorithmpp371-378.
  9. Viksten ,Henrik, 2013, Performance and scalability of Sudoku solvers,Bachelor's Theses at NADA,Sweden
  10. T. Kovacs, Nov 2008. , Artificial Intelligence through Search: Solving Sudoku Puzzles, Journal Papers, University of Bristol, Department of Computer Science, pp 1-14.
Index Terms

Computer Science
Information Sciences

Keywords

Sudoku Algorithm (Backtracking Brute force)

Powered by PhDFocusTM