{"id":22288366,"url":"https://github.com/unclebob/sudoku","last_synced_at":"2025-07-28T22:32:37.622Z","repository":{"id":51898347,"uuid":"218850533","full_name":"unclebob/sudoku","owner":"unclebob","description":"Sudoku solver for E61 of Clean Code (cleancoders.com)","archived":false,"fork":false,"pushed_at":"2021-05-09T05:34:45.000Z","size":13,"stargazers_count":27,"open_issues_count":1,"forks_count":3,"subscribers_count":8,"default_branch":"master","last_synced_at":"2023-04-12T14:17:43.890Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Clojure","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/unclebob.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-10-31T20:00:22.000Z","updated_at":"2023-04-12T14:17:43.890Z","dependencies_parsed_at":"2022-08-23T07:50:06.870Z","dependency_job_id":null,"html_url":"https://github.com/unclebob/sudoku","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/unclebob%2Fsudoku","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/unclebob%2Fsudoku/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/unclebob%2Fsudoku/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/unclebob%2Fsudoku/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/unclebob","download_url":"https://codeload.github.com/unclebob/sudoku/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":227961828,"owners_count":17847841,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-12-03T17:04:31.054Z","updated_at":"2024-12-03T17:04:31.192Z","avatar_url":"https://github.com/unclebob.png","language":"Clojure","readme":"# sudoku\n\n### Testing Strategy.\nSudoku boards are traditionally rank 3.  That means there are 3^2 rows\nand 3^2 columns and 3^2 possible digits.  \n\nWe will begin testing with a rank 1 board.  Such a board has one row,\none column, and only one valid number: 1.  Thus there is only one solution.  `[[1]]`.  \n\nThen we'll move on to the rank 2 board.  This has 4 rows, 4 columns, and\n4 valid numbers `[1 2 3 4]`.  They have the form:\n\n    [[d d d d]\n    [d d d d]\n    [d d d d]\n    [d d d d]]\n\nOnce that is solved, I expect the general case to be solved as well.\n  \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funclebob%2Fsudoku","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Funclebob%2Fsudoku","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funclebob%2Fsudoku/lists"}