DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2010.19
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.
Index Terms:
Computing Prescriptions, Francis Sullivan, Ernst Mucke, Sudoku
Citation:
Francis Sullivan, "Whip Until Solved," Computing in Science and Engineering, vol. 12, no. 1, pp. 73-75, Jan./Feb. 2010, doi:10.1109/MCSE.2010.19 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||