EmbeddingGemma 2: an open, lightweight multimodal embedding model
deepmind.google·6d ago
AI Engineering
Lobsters·28d ago·14 min read
There are only twelve 4x4 sudokus - and a cool trick for finding minimal subsets
TL;DR
Only twelve distinct 4x4 sudoku solutions exist, with a total of 288 possible configurations. A method for identifying minimal subsets of these solutions was also developed.
✦ Why It Matters
Consider implementing this method to generate unique and minimal sudoku puzzles for your applications.
Key Takeaways
- Use brute-force to explore all possible sudoku configurations.
- Identify distinct solutions by considering digit permutations.
- Develop minimal puzzles that maintain unique solutions.
- Apply findings to enhance puzzle generation in software.
How It Works
The brute-force algorithm fills the sudoku grid recursively, checking for valid placements based on existing row, column, and box constraints. By counting permutations of the digits, the algorithm identifies distinct structural solutions.
To find minimal puzzles, subsets of filled cells are evaluated to ensure that removing any digit results in multiple possible solutions.