Upper Bounds for the Number of Solutions to Spatially Coupled Sudokus
Tadahiro Kitazono, Kazushi Mimura
TL;DR
This paper uses combinatorial methods to determine upper bounds on the number of solutions for spatially coupled Sudokus, providing insights into their complexity and solution space.
Contribution
It introduces a novel combinatorial approach to estimate the maximum number of solutions for this specific Sudoku variant.
Findings
Derived upper bounds for solution counts
Enhanced understanding of spatially coupled Sudoku complexity
Potential applications in puzzle design and analysis
Abstract
Based on combinatorics, we evaluate the upper bounds for the number of solutions to spatially coupled Sudokus, which are popular logic puzzles.
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
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Coding theory and cryptography