Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T06:06:14.773Z Has data issue: false hasContentIssue false

Sudoku strategies using graph theory

Published online by Cambridge University Press:  23 August 2024

Jeff Brown*
Affiliation:
UNCW Mathematics and Statistics Department, 601 South College Road, Wilmington, NC 28403 USA e-mail: brownj@uncw.edu

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different. We will define xy-chains as paths in a graph, and properties of the paths show why the technique works.

Information

Type
Articles
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Authors, 2024 Published by Cambridge University Press on behalf of The Mathematical Association