Abstract
As I have already explained in Chapter 2, backtracking is a nice way of saying “guessing.” When you exhaust all strategies you know, you can only pick a cell that you haven’t yet solved and try out one of its candidates. If you reach a contradiction, you need to revert the Sudoku grid back to what it was before your arbitrary choice and try another candidate—hence the “back” of backtracking.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Giulio Zambon
About this chapter
Cite this chapter
Zambon, G. (2015). Implementing “Backtrack”. In: Sudoku Programming with C. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-0995-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4842-0995-0_13
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-0996-7
Online ISBN: 978-1-4842-0995-0
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books