Research Article
Solving Sudoku with Boolean Algebra
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 52 - Issue 21 |
| Published: August 2012 |
| Authors: Abu Sayed Chowdhury, Suraiya Akhter |
10.5120/8331-9024
|
Abu Sayed Chowdhury, Suraiya Akhter . Solving Sudoku with Boolean Algebra. International Journal of Computer Applications. 52, 21 (August 2012), 1-5. DOI=10.5120/8331-9024
@article{ 10.5120/8331-9024,
author = { Abu Sayed Chowdhury,Suraiya Akhter },
title = { Solving Sudoku with Boolean Algebra },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 52 },
number = { 21 },
pages = { 1-5 },
doi = { 10.5120/8331-9024 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Abu Sayed Chowdhury
%A Suraiya Akhter
%T Solving Sudoku with Boolean Algebra%T
%J International Journal of Computer Applications
%V 52
%N 21
%P 1-5
%R 10.5120/8331-9024
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Sudoku is a very popular puzzle which consists of placing several numbers in a squared grid according to some simple rules. In this paper, we present a Sudoku solving technique named Boolean Sudoku Solver (BSS) using only simple Boolean algebras. Use of Boolean algebra increases the execution speed of the Sudoku solver. Simulation results show that our method returns the solution of the Sudoku in minimum number of iterations and outperforms the existing popular approaches.
References
- J. Almog, "Evolutionary Computing Methodologies for Constrained Parameter, Combinatorial Optimization: Solving the Sudoku Puzzle," in Proc. of IEEE AFRICON, pp. 1-6, September 2009, Nairobi, Kenya.
- B. Arnoldy, "Sudoku Strategies," The Home Forum (The Christian Science Monitor), Schaschek, Sarah, March 2006.
- H. Balakrishnan, I. Hwang and C. J. Tomlin, "Polynomial approximationalgorithms for belief matrix maintenance in identity management," in Proc. of IEEE Conf. Decision Control, pp. 4874-4979, December 2004.
- C. Boyer,"Sudoku's French ancestors," http://web. archive. org. Retrieved on 3 August 2009.
- D. Diaz-Pernil, C. M. Fernandez-Marquez, M. Garcfa- Quisrnondo, M. A. Gutierrez-Naranjo and M. A. Martinezdel- Arnor, "Solving Sudoku with Membrane Computing," in Proc. of IEEE BIC-TA, pp. 610-615, Changsha, November 2010.
- S. Kirkpatrick, "Message-passing and Sudoku," Available in http://www. www. cs. huji. ac. il/ kirk/Sudoku. ppt.
- T. K. Moon and J. H. Gunther, "Multiple constraint satisfaction by belief propagation: An example using Sudoku," in Proc. of SMCals/IEEE Mountain Workshop on Adaptive and Learning System, pp. 122-126, Logan, UT, July 2006.
- T. K. Moon, J. H. Gunther and J. J. Kupin , "Sinkhorn Solves Sudoku," Transactions On Information Theory, Vol. 55, No. 4, pp. 1741-1746, April 2009.
- Pegg, The Mathematical Association of America, http://www. maa. org/editorial/mathgames/mathgames 09 05 05. html. Retrieved on October 3, 2006.
- Y. Sato and H. Inoue, "Solving Sudoku with Genetic Operations that Preserve Building Blocks," in Proc. of IEEE CIG, pp. 23-29, Dublin, September 2010.
- S. Schaschek, "Sudoku champ's surprise victory". The Prague Post. Retrieved on August 13, 2006.
- P. S. Segundo and A. Jimnez, "Using graphs to derive CSP heuristics and its application to Sudoku," In Proc. of IEEE ICTAI, pp. 538-545, Newark, NJ, November 2009.
- R. Sinkhorn, "A relationship between arbitrary positive matrices and oubly stochastic matrices," Ann. Math. Statist. , vol. 35, pp. 876-879, June 1964.
- R. Sinkhorn, "Diagonal equivalence to matrices with prescribed row and column sums," Amer. Math. Monthly, vol. 35, pp. 876-879, 1967.
Index Terms
Keywords