S_\infty-RANK AND LAC INVARIANT FOR THE EVALUATION OF DIFFICULTY LEVEL OF SUDOKU PUZZLES BY BOOLEAN GROEBNER BASES
Far East Journal of Applied Mathematics · 2025
DOI: 10.17654/0972087125030 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Applied Mathematics, 2025. Verfasst von Tetsuo Nakano und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Nakano, T., Shindou, M., & Yoshihara, T. (2025). S_\infty-RANK AND LAC INVARIANT FOR THE EVALUATION OF DIFFICULTY LEVEL OF SUDOKU PUZZLES BY BOOLEAN GROEBNER BASES. Far East Journal of Applied Mathematics. https://doi.org/10.17654/0972087125030
Vancouver
Nakano T, Shindou M, Yoshihara T. S_\infty-RANK AND LAC INVARIANT FOR THE EVALUATION OF DIFFICULTY LEVEL OF SUDOKU PUZZLES BY BOOLEAN GROEBNER BASES. Far East Journal of Applied Mathematics. 2025. doi:10.17654/0972087125030
BibTeX
@article{Nakano2025,
author = {Nakano, Tetsuo and Shindou, Miku and Yoshihara, Tsukasa},
title = {S_\infty-RANK AND LAC INVARIANT FOR THE EVALUATION OF DIFFICULTY LEVEL OF SUDOKU PUZZLES BY BOOLEAN GROEBNER BASES},
journal = {Far East Journal of Applied Mathematics},
year = {2025},
doi = {10.17654/0972087125030}
}
EUVIMED