Electronic Notes in Theoretical Computer Science · 2007 · 30 citations · 6 references
ComputingComputer ScienceMathematicsAlgorithmsArtificial IntelligenceGrid ComputingNumber RecognitionNumber-theoretic AlgorithmsPuzzle GenerationRewriting SystemsSudoku Solving
The aim of the sudoku puzzle (also known as number place in the United States) is to enter a numeral from 1 through 9 in each cell of a grid, most frequently a 9 × 9 grid made up of 3 × 3 subgrids, starting with various numerals given in some of the cells (the “givens”). Each row, column, and region must contain only one instance of each numeral. In this paper we show how a sudoku puzzle can be solved with rewriting rules using Maude. Three processes (scanning, marking up, and analysis) are the classical techniques for solving sudokus. Elimination is the main strategy that we have employed. The strategy what-if and several contingencies are also implemented.
6
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Maude: specification and programming in rewriting logic
Manuel Clavel, Francisco Durán, Steven Eker et al. · Theoretical Computer Science · 2002 · 772 citations · Full text