Title :
Solving Sudoku Puzzles Using Improved Artificial Bee Colony Algorithm
Author :
Pacurib, Jaysonne A. ; Seno, Glaiza Mae M ; Yusiong, John Paul T
Author_Institution :
Visayas Tacloban Coll., Div. of Natural Sci. & Math., Univ. of the Philippines, Tacloban City, Philippines
Abstract :
Sudoku puzzles belong to a set of hard problems called NP-Complete problems. A Sudoku puzzle is a logic-based combinatorial puzzle with rules that are relatively simple. Various algorithms have been applied to solve this combinatorial problem. A relatively new algorithm called Artificial Bee Colony algorithm was developed in 2005. The algorithm mimics the way bees forage for food and has been successfully applied to a wide array of NP-Complete problems. This paper explores the possibility of using an improved variant of the Artificial Bee Colony algorithm in solving Sudoku Puzzles. The results obtained support the conclusion that the algorithm can be used to solve Sudoku Puzzles efficiently and effectively.
Keywords :
computational complexity; optimisation; NP-complete problems; Sudoku puzzles; artificial bee colony algorithm; logic-based combinatorial puzzle; Cities and towns; Constraint optimization; Educational institutions; Equations; Mathematics; NP-complete problem; Probability;
Conference_Titel :
Innovative Computing, Information and Control (ICICIC), 2009 Fourth International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-1-4244-5543-0
DOI :
10.1109/ICICIC.2009.334