Abstract
Many algorithms exist to solve all sorts of puzzle. A lot of these have been implemented in software. The reader is invited to seek out alternative solutions and are challenged to provide their own implementation(s). Russell and Norvig [320] provide the necessary background to the history and adaptation of many of these techniques within the AI domain. After introducing the problem, we will briefly discuss Heuristic search [16], Brute Force (exhaustive) and Backtracking [401]. The only mandatory condition for a Sudoku puzzle is that it must have a solution, although it should be solved logically and without guessing or search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tweedale, J.W., Jain, L.C. (2011). Case Study Background - Sudoku. In: Embedded Automation in Human-Agent Environment. Adaptation, Learning, and Optimization, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22676-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-22676-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22675-5
Online ISBN: 978-3-642-22676-2
eBook Packages: EngineeringEngineering (R0)