S_\infty-RANK AND LAC INVARIANT FOR THE EVALUATION OF DIFFICULTY LEVEL OF SUDOKU PUZZLES BY BOOLEAN GROEBNER BASES
The Sudoku is a very popular puzzle all over the world and it is also an interesting subject in discrete mathematics. Recently, an excellent algorithm called the Inoue algorithm has been developed for solving Sudoku puzzles based on boolean Groebner bases, and successfully applied to the mathematical evaluation of the difficulty level of Sudoku puzzles.
Authors
- Miku Shindou
- Tsukasa Yoshihara
- Tetsuo Nakano
Publication Details
- Journal
- Far East Journal of Applied Mathematics
- Published
- 2025-09-23
- DOI
- https://doi.org/10.17654/0972096025012
- Primary Topic
- Advanced Algebra and Geometry
- Type
- article
- Field-Weighted Citation Impact
- 0.00