You might be interested in my implementation in javascript. Firstly you have to understand Exact Cover. An exact cover problem is a problem where you’re given a bunch of choices, and a set of constraints and your challenge is to select a bunch of the choices that will fill every constraint exactly once. For example, … Read more
Here is the way my own SuDoKu program does it: Start with a complete, valid board (filled with 81 numbers). Make a list of all 81 cell positions and shuffle it randomly. As long as the list is not empty, take the next position from the list and remove the number from the related cell. … Read more
I have a solution that works, but you’ll have to translate it to OpenCV yourself. It’s written in Mathematica. The first step is to adjust the brightness in the image, by dividing each pixel with the result of a closing operation: src = ColorConvert[Import[“http://davemark.com/images/sudoku.jpg”], “Grayscale”]; white = Closing[src, DiskMatrix[5]]; srcAdjusted = Image[ImageData[src]/ImageData[white]] The next step … Read more