konstin/sudoku-in-python-packaging: Sudoku solving in python packaging
github.com · 355 words · saved by 1 readers
Sudoku solving in python packaging. Contribute to konstin/sudoku-in-python-packaging development by creating an account on GitHub.
Solve sudokus not in python, but in python packages. Solving the versions of python package from your requirements is NP-complete, in the worst case it runs exponentially slow. Sudokus are also NP-complete, which means we can solve sudokus with python packaging. Each cell in the sudoku grid is a package sudoku_{x}_{y} (0 indexed), and the version (1-9) is the value in the field, so you can write a pyproject.toml and the installed packages are the solution. [project] name = "sudoku" version = "1.0.0" dependencies = [ "sudoku_3_1 == 2", "sudoku_5_7 == 6", "sudoku_0_7 == 5" ... ] Usage You…
saved by
related reading
- mildbyte.xyz • Solving Wordle with uv's dependency resolvermildbyte.xyz
- Solving Every Sudoku Puzzlenorvig.com
- GitHub - srush/Tensor-Puzzles: Solve puzzles. Improve your pytorch.github.com
- uv: An extremely Fast Python Package Manager :: Jane Streetjanestreet.com
- uvdocs.astral.sh
- pytudes/ipynb/ProbabilityParadox.ipynb at main · norvig/pytudesgithub.com
- Pandoc - indexpandoc.org
- CodaLab Worksheetsworksheets.codalab.org
- Cookbookcookbook.openai.com
- pytudes/ipynb/ProbabilitySimulation.ipynb at main · norvig/pytudesgithub.com
- Minesweeper is NP-complete.academic.timwylie.com
- P versus NP problem - Wikipediaen.wikipedia.org