Sudoku Programming with C

Sudoku Programming with C teaches you how to write computer programs to solve and generate Sudoku puzzles. This is a practical book that will provide you with everything you need to write your own books of Sudoku Classic and Samurai puzzles. But be warned: after reading it, you’ll discover that the puzzles in your local paper are not so challenging after all!

We like Sudokus because they test our capacity to recognize and interpret patterns. But how are the clues generated? Where do those quasi-symmetrical configurations come from? When the author explored the Web to find out, he discovered that there were many sites that explained how to solve Sudokus, but none that told him how create them. He also saw many sites and apps to play Sudoku, but, perhaps not surprising, no indication of how they worked.

So, he had to develop his own applications in order to find out. And, from the very start, he decided that he would publish the code for anyone else to use and perhaps tinker with, but the author wrote it in such a way that also lets readers with limited knowledge of programming techniques understand it. In fact, you could decide to start generating thousands of puzzles almost immediately, and go through the explanations of algorithms and techniques later, a bit at a time. The author chose to write the application in ‘plain old C’ because he wanted to make the code accessible to as many people as possible.

In this book, you will find an explanation of all solving strategies, and the code to implement them. Writing the Solver application was more difficult than writing the Generator, because it required designing and implementing each strategy separately. However, the author wanted to include a solving program capable of listing the strategies necessary to solve any particular puzzle. He also wanted to check whether a puzzle was solvable analytically, without any guessing.

This book includes the full listings of both the Generator and the Solver, and explanations of all C modules, with walk-throughs and examples.

Table of Contents

Chapter 1: Modeling a Sudoku Puzzle in C

Chapter 2: The Strategies

Chapter 3: The Solver Program

Chapter 4: Implementing “Unique”

Chapter 5: Implementing “Naked” Strategies

Chapter 6: Implementing “Hidden” Strategies

Chapter 7: Implementing “Box-Line”

Chapter 8: Implementing “Pointing Line”

Chapter 9: Implementing “Lines” Strategies

Chapter 10: Implementing “Y-wing”

Chapter 11: Implementing “XV-chain”

Chapter 12: Implementing “Rectangle”

Chapter 13: Implementing “Backtrack”

Chapter 14: Solving Thousands of Puzzles

Chapter 15: Generating Sudokus

Chapter 16: Puzzle Statistics and More Puzzles

Chapter 17: Special Sudokus

Chapter 18: Multi-Grid Sudokus

Chapter 19: Development Environment

Chapter 20: Abbreviations and Acronyms

About the Author

Giulio Zambon s first love was physics, but he decided to dedicate himself to software development more than 30 years ago: back when computers were still made of transistors and core memories, programs were punched on cards, and Fortran only had arithmetic IFs. Over the years, he learned a dozen computer languages and worked with all sorts of operating systems. His specific interests were in telecom and real-time systems, and he managed several projects to their successful completion. In 2001 Giulio founded his own company offering computer telephony integration (CTI) services, and he used JSP and Tomcat exclusively to develop the web side of the service platform. Back in Australia after many years in Europe, he now dedicates himself to writing software to generate and solve numeric puzzles. His web site, http://zambon.com.au/, is written in JSP on his dedicated server, which, unsurprisingly, runs Tomcat!