https://github.com/unclebob/sudoku

Sudoku solver for E61 of Clean Code (cleancoders.com)
https://github.com/unclebob/sudoku

Last synced: about 1 month ago
JSON representation

Sudoku solver for E61 of Clean Code (cleancoders.com)

• Host: GitHub
• URL: https://github.com/unclebob/sudoku
• Owner: unclebob
• Created: 2019-10-31T20:00:22.000Z (about 5 years ago)
• Default Branch: master
• Last Pushed: 2021-05-09T05:34:45.000Z (over 3 years ago)
• Last Synced: 2023-04-12T14:17:43.890Z (over 1 year ago)
• Language: Clojure
• Size: 12.7 KB
• Stars: 27
• Watchers: 8
• Forks: 3
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# sudoku

### Testing Strategy.

Sudoku boards are traditionally rank 3.  That means there are 3^2 rows

and 3^2 columns and 3^2 possible digits.  

We will begin testing with a rank 1 board.  Such a board has one row,

one column, and only one valid number: 1.  Thus there is only one solution.  `[[1]]`.  

Then we'll move on to the rank 2 board.  This has 4 rows, 4 columns, and

4 valid numbers `[1 2 3 4]`.  They have the form:

    [[d d d d]

    [d d d d]

    [d d d d]

    [d d d d]]

Once that is solved, I expect the general case to be solved as well.