Python for education: the exact cover problem
Andrzej Kapanowski
TL;DR
This paper presents a Python implementation of Algorithm X by Knuth, demonstrating its effectiveness in solving the exact cover problem with applications to puzzles like Sudoku and Latin squares.
Contribution
It provides a Python-based implementation of Algorithm X and showcases its application to various combinatorial puzzles, which was not previously available.
Findings
Successfully solved puzzles like Sudoku, Latin squares, and pentominoes.
Demonstrated the practicality of Algorithm X in Python for educational purposes.
Provided example solutions and performance insights.
Abstract
Python implementation of Algorithm X by Knuth is presented. Algorithm X finds all solutions to the exact cover problem. The exemplary results for pentominoes, Latin squares and Sudoku are given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Physics and Python Applications · Algorithms and Data Compression · Advanced Computational Techniques and Applications