loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: P. A. Roach 1 ; S. K. Jones 1 ; S. Perkins 1 and I. J. Grimstead 2

Affiliations: 1 University of Glamorgan, United Kingdom ; 2 Cardiff University, United Kingdom

ISBN: 978-989-8111-66-1

Keyword(s): Search, Constraints, Quasi-Magic Sudoku, Coding Theory.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Industrial Applications of AI ; Soft Computing ; State Space Search ; Symbolic Systems

Abstract: The popular logic puzzle, Sudoku, consists of placing the digits 1, …, 9 into a 9 x 9 grid, such that each digit appears only once in each row, column, and subdivided ‘mini-grid’ of size 3 x 3. Uniqueness of solution of a puzzle is ensured by the positioning of a number of given values. Quasi-Magic Sudoku adds the further constraint that within each mini-grid, every row, column and diagonal must sum to 15±∆, where ∆ is chosen to take a value between 2 and 8. Recently Sudoku has been shown to have potential for the generation of erasure correction codes. The additional quasi-magic constraint results in far fewer given values being required to ensure uniqueness of solution, raising the prospect of improved usefulness in code generation. Recent work has highlighted useful domain knowledge concerning cell interrelationships in Quasi-Magic Sudoku for the case ∆ = 2, providing pruning conditions to reduce the size of search space that need be examined to ensure uniqueness of solution. This paper examines the usefulness of the identified rich knowledge in restricting search space size. The knowledge is implemented as pruning conditions in a backtracking implementation of a Quasi-Magic Sudoku solver, with a further cell ordering heuristic. Analysis of the improvement in processing time, and thereby of the potential usefulness of Quasi-Magic Sudoku for code generation, is provided. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.204.173.36

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Roach P.; Jones S.; Perkins S.; Grimstead I. and (2009). A KNOWLEDGE-RICH APPROACH TO THE RAPID ENUMERATION OF QUASI-MAGIC SUDOKU SEARCH SPACES.In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8111-66-1, pages 246-254. DOI: 10.5220/0001659502460254

@conference{icaart09,
author={P. A. Roach and S. K. Jones and S. Perkins and I. J. Grimstead},
title={A KNOWLEDGE-RICH APPROACH TO THE RAPID ENUMERATION OF QUASI-MAGIC SUDOKU SEARCH SPACES},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2009},
pages={246-254},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001659502460254},
isbn={978-989-8111-66-1},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - A KNOWLEDGE-RICH APPROACH TO THE RAPID ENUMERATION OF QUASI-MAGIC SUDOKU SEARCH SPACES
SN - 978-989-8111-66-1
AU - Roach, P.
AU - Jones, S.
AU - Perkins, S.
AU - Grimstead, I.
PY - 2009
SP - 246
EP - 254
DO - 10.5220/0001659502460254

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.