{"id":20324353,"url":"https://github.com/oniani/sat-sudoku","last_synced_at":"2026-06-08T15:31:54.412Z","repository":{"id":112156683,"uuid":"160554434","full_name":"oniani/sat-sudoku","owner":"oniani","description":"Implementation of the paper \"Sudoku as a SAT Problem\"","archived":false,"fork":false,"pushed_at":"2021-11-15T14:23:45.000Z","size":591,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-30T03:09:05.443Z","etag":null,"topics":["games","np-hard","python3","sat","sudoku","sudoku-solver"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/oniani.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-12-05T17:29:35.000Z","updated_at":"2024-05-03T00:24:58.000Z","dependencies_parsed_at":null,"dependency_job_id":"59707921-6ca5-4a25-b5ac-f96a3a3f42d6","html_url":"https://github.com/oniani/sat-sudoku","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/oniani/sat-sudoku","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oniani%2Fsat-sudoku","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oniani%2Fsat-sudoku/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oniani%2Fsat-sudoku/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oniani%2Fsat-sudoku/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/oniani","download_url":"https://codeload.github.com/oniani/sat-sudoku/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oniani%2Fsat-sudoku/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34069489,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-08T02:00:07.615Z","response_time":111,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["games","np-hard","python3","sat","sudoku","sudoku-solver"],"created_at":"2024-11-14T19:33:40.065Z","updated_at":"2026-06-08T15:31:54.393Z","avatar_url":"https://github.com/oniani.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SAT Sudoku Solver\n\nThis is the implementation of the SAT sudoku solver based on the paper by Inês Lynce and Jöel\nOuaknine titled _Sudoku as a SAT Problem_.\n\nSudoku is modeled as the SAT problem. The idea is to formulate a sudoku puzzle as a SAT formula if\nthe puzzle has a solution. Then we use the SAT program to find the solution.\n\nSAT is a program that solves the satisfiability problem: given a formula, it either returns an\nassignment that makes it true, or says that no such assignment exists. It uses a restricted form of\npropositional formula called CNF (Conjunctive Normal Form). CNF consists of a set of clauses, each\nof which is a set of literals. A literal is a variable or its negation. Each clause is interpreted\nas the disjunction of its literals, and the formula as a whole is interpreted as the conjunction of\nthe clauses.\n\nThis project uses [MiniSat](http://minisat.se/)'s Rust reimplementation\n[RatSat](https://github.com/qnighy/ratsat).\n\nFor the in-depth explanation of how the sudoku solver works, see the [paper](paper.pdf).\n\n## API\n\n```console\n$ ./solve A_PATH_TO_THE_PUZZLE\n```\n\n## Examples\n\nThere are 9 sample sudoku puzzles available under directory named `puzzles`. To solve the first\npuzzle, simply run `./solve puzzles/sudoku1.puzzle`.\n\n## References\n\n- [Inês Lynce and Jöel Ouaknine, Sudoku as a SAT Problem](paper.pdf)\n- [RatSat](https://github.com/qnighy/ratsat)\n- [MiniSat](http://minisat.se/)\n- [Sudoku](https://en.wikipedia.org/wiki/Sudoku)\n\n## License\n\n[MIT License](LICENSE)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Foniani%2Fsat-sudoku","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Foniani%2Fsat-sudoku","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Foniani%2Fsat-sudoku/lists"}