{"id":20678585,"url":"https://github.com/yingjia-z/sudoku-solver","last_synced_at":"2026-05-15T21:37:01.807Z","repository":{"id":239398747,"uuid":"799417427","full_name":"Yingjia-Z/sudoku-solver","owner":"Yingjia-Z","description":"A three-method Sudoku solver using Constraint Satisfaction Problem (CSP) algorithms.","archived":false,"fork":false,"pushed_at":"2024-05-12T05:13:11.000Z","size":630,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-02T03:46:47.799Z","etag":null,"topics":["csp","jupyter-notebook","rl"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","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/Yingjia-Z.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-12T04:36:42.000Z","updated_at":"2024-05-12T05:13:14.000Z","dependencies_parsed_at":"2024-05-12T06:22:52.960Z","dependency_job_id":"148e59ff-6eb3-4ede-a344-c1f63367987b","html_url":"https://github.com/Yingjia-Z/sudoku-solver","commit_stats":null,"previous_names":["yingjia-z/sudoku-solver"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Yingjia-Z/sudoku-solver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Yingjia-Z%2Fsudoku-solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Yingjia-Z%2Fsudoku-solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Yingjia-Z%2Fsudoku-solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Yingjia-Z%2Fsudoku-solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Yingjia-Z","download_url":"https://codeload.github.com/Yingjia-Z/sudoku-solver/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Yingjia-Z%2Fsudoku-solver/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266664248,"owners_count":23964931,"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","status":"online","status_checked_at":"2025-07-23T02:00:09.312Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"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":["csp","jupyter-notebook","rl"],"created_at":"2024-11-16T21:21:02.287Z","updated_at":"2026-05-15T21:37:01.777Z","avatar_url":"https://github.com/Yingjia-Z.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Sudoku Solver\n\nThis project uses 3 distinct CSP-based methods to solve Sudoku puzzles efficiently. Each approach incorporates different strategies and heuristics to speed up solving times.\n\n### Overview\nIn the [`solver`](sudoku.ipynb) Jupyter notebook:\n\n#### Part A: CSP Formalization\n- **Formal Description**: Provides a formal CSP description of Sudoku, detailing variables, their domains, and the constraints among them.\n\n#### Part B: Solver Implementations\n- **Version A**: Standard backtracking search (no forward checking, random variable order, random value order).\n- **Version B**: Standard backtracking search + forward checking (random variable order, random value order).\n- **Version C**: Standard backtracking search + forward checking + three heuristics to order variables and values, using random selection to break ties.\n  - Three heuristics:\n    - Most Constrained Variable\n    - Most Constraining Variable\n    - Least-Constraining Value\n\n#### Part C: Performance Evaluation\n- **Testing**: Runs each version on test puzzles of varying difficulty levels (easy, medium, difficult, and evil) to compare performance.\n- **Metrics Reported**:\n  - **Time Performance**: Reports average time and standard deviation to complete each puzzle over 50 trials.\n  - **Efficiency**: Details the average number of nodes expanded and the standard deviation for each puzzle. Nodes are considered expanded when they are removed from the queue and their children are added.\n\n#### Notes\n- **Run Feasibility**: For Versions A and B, consider reducing the number of trials from 50 to a more feasible number due to time constraints.\n- **High Efficiency**: Version C solves puzzles of all difficulty levels in under 0.136 seconds.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyingjia-z%2Fsudoku-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyingjia-z%2Fsudoku-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyingjia-z%2Fsudoku-solver/lists"}