Solving Sudoku Puzzles with Rewriting Rules

DOI10.1016/j.entcs.2007.06.009zbMath1279.68119OpenAlexW2104875665MaRDI QIDQ2873776

Gustavo Santos-García, Miguel Palomino

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.06.009

zbMATH Keywords

rewriting logicMaudeSudoku puzzle

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Grammars and rewriting systems (68Q42)

Related Items (5)

A sublinear Sudoku solution in cP systems and its formal verification ⋮ The Maude strategy language ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Unnamed Item ⋮ Generalizing Sudoku to three dimensions

Uses Software

• Maude

Cites Work

• Maude
• Conditional rewriting logic as a unified model of concurrency
• Maude: specification and programming in rewriting logic
• A Rewriting Semantics for Maude Strategies
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving Sudoku Puzzles with Rewriting Rules