|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Francis Sullivan, "Whip Until Solved," Computing in Science and Engineering, vol. 12, no. 1, pp. 73-75, January/February, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/MCSE.2010.19, author = {Francis Sullivan}, title = {Whip Until Solved}, journal ={Computing in Science and Engineering}, volume = {12}, number = {1}, issn = {1521-9615}, year = {2010}, pages = {73-75}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2010.19}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computing in Science and Engineering TI - Whip Until Solved IS - 1 SN - 1521-9615 SP73 EP75 EPD - 73-75 A1 - Francis Sullivan, PY - 2010 KW - Computing Prescriptions KW - Francis Sullivan KW - Ernst Mucke KW - Sudoku VL - 12 JA - Computing in Science and Engineering ER - | |||
In this installment of Prescriptions, I'll explain how to use iterated projections to design an algorithm for solving Sudoku puzzles. I'll also illustrate why iteration doesn't always give the desired result.
1. T. Yato, and T. Seta, "Complexity and Completeness of Finding another Solution and Its Application to Puzzles," IEICE Trans. Fundamentals Electronics, vol. E86-A, no. 5, 2003, pp. 1052–1060.
2. T.K. Moon, J.H. Gunther, and J. Kupin, "Sinkhorn Solves Sudoku," IEEE Trans. Information Theory, vol. 55, no. 4, 2009, pp. 1741–1746.
3. F. E. Sullivan, "A Generalization of Best Approximation Operators," Annali di Matematica Pura ed Applicata, vol. 107, no. 1, 1975, pp. 245–261.
4. V. Elser, I. Rankenburg, and P. Thibault, "Searching with Iterated Maps," Proc. Nat'l Academy of Sciences, vol. 104, no. 2, 2007, pp. 418–423.