{"id":20761855,"url":"https://github.com/james-p-d/sudoku","last_synced_at":"2026-05-07T06:40:33.941Z","repository":{"id":170649472,"uuid":"223252226","full_name":"James-P-D/Sudoku","owner":"James-P-D","description":"A Sudoku puzzle solver with algorithm in F# and UI in C# Winforms","archived":false,"fork":false,"pushed_at":"2021-07-04T20:44:13.000Z","size":333,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-26T18:47:40.734Z","etag":null,"topics":["ai","csharp","fsharp","sudoku","winforms"],"latest_commit_sha":null,"homepage":"","language":"C#","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/James-P-D.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":"2019-11-21T19:46:28.000Z","updated_at":"2021-07-04T20:44:15.000Z","dependencies_parsed_at":null,"dependency_job_id":"7ae3071a-86e6-4022-af14-80264af67e43","html_url":"https://github.com/James-P-D/Sudoku","commit_stats":null,"previous_names":["james-p-d/sudoku"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/James-P-D/Sudoku","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/James-P-D%2FSudoku","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/James-P-D%2FSudoku/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/James-P-D%2FSudoku/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/James-P-D%2FSudoku/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/James-P-D","download_url":"https://codeload.github.com/James-P-D/Sudoku/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/James-P-D%2FSudoku/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32726667,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-07T02:14:30.463Z","status":"ssl_error","status_checked_at":"2026-05-07T02:14:29.405Z","response_time":62,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["ai","csharp","fsharp","sudoku","winforms"],"created_at":"2024-11-17T10:26:57.379Z","updated_at":"2026-05-07T06:40:33.916Z","avatar_url":"https://github.com/James-P-D.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sudoku\nA Sudoku puzzle solver with algorithm in F# and UI in C# Winforms\n\n![Screenshot](https://github.com/James-P-D/Sudoku/blob/master/Screenshot.gif)\n\n## Method\n\nMost Sudoku solvers I came across simply chose to implement [Peter Norvig's method](https://norvig.com/sudoku.html), but I decided I'd rather use the same method I use when solving the puzzle with pen-and-paper.\n\n### Easy Cells\n\nThe easiest step for finding the value for a particular cell, is to find an empty cell and then figure out what it *can't* be.\n\nFor example, lets consider the following board taken from the [Guardian Easy Sudoku #4,612 from Mon 18 Nov, 2019](https://www.theguardian.com/lifeandstyle/2019/nov/18/sudoku-4612-easy).\n\n![Easy Cells Screenshot](https://github.com/James-P-D/Sudoku/blob/master/Easy.png)\n\nIn the above initial board, concentrate on the 9x9 square in the middle-left of the board, and in this square, look at the cell in the very centre.  \nWe can instantly tell that value of this cell can't be `3 or 5` because of other values in the 9x9 square. We can also tell that is can't be `1, 3 or 6` because of other cells in the same column. Finally, from analysing the values in the rest of the row we can also tell that it can't be `2, 3, 7, 8, or 9`. Putting all this information together and we know the cell can't be `1, 2, 3, 5, 6, 7, 8 or 9`, and must therefore be `4`.\n\n### Medium Cells\n\nHaving found all the easy cells, we find ourselves with the following board:\n\n![Medium Cells Screenshot](https://github.com/James-P-D/Sudoku/blob/master/Medium.png)\n\nThere are no more easy solutions to be found, but let's consider the central 9x9 square.  \nThis 9x9 square is missing the numbers `4, 5 and 6`. The numbers `4 and 5` could conceivably go in any of three available cells, but the number `6` *cannot* be on the top row because of the other `6` in the 9x9 square to the right. Therefore the `6` *must* be in the empty cell on the bottom row of the 3x3 square.\n\n### Hard Cells\n\nBrute force. Still to be implemented.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjames-p-d%2Fsudoku","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjames-p-d%2Fsudoku","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjames-p-d%2Fsudoku/lists"}