Compile all the small solvers.
Actually print the solution(s)
Move examples in examples directory
Remove incorrect comment and ue variable.
malloc correct size and only calculate neighbourhood for unknown cells.
Increment n in the loop rather than below.
Move everything except u into local arrays.
Pass neighbourhood array rather than n.
Split apart the neighbourhood generation.
Documented version for reference.
Will solve any size grid in theory now.
Moved stuff around, should now solve bigger grids given a new version of taken.
WIP very small sudoku solver for IOCCC
Add some explaintory comments
Simplified in several ways