ダウンロード数: 9
このアイテムのファイル:
| ファイル | 記述 | サイズ | フォーマット | |
|---|---|---|---|---|
| 2255-01.pdf | 6.03 MB | Adobe PDF | 見る/開く |
| タイトル: | Boolean Groebner 基底を用いた数独パズルの数学的難易度指標の相関について |
| その他のタイトル: | On the correlation of some mathematical indicators of difficulty level of Sudoku puzzles in terms of Boolean Groebner bases (Computer Algebra : Foundations and Applications) |
| 著者: | 中野, 哲夫  進藤, 未来 吉原, 元 |
| 著者名の別形: | Nakano, Tetsuo Shindou, Miku Yoshihara, Tsukasa |
| 発行日: | Jun-2023 |
| 出版者: | 京都大学数理解析研究所 |
| 誌名: | 数理解析研究所講究録 |
| 巻: | 2255 |
| 開始ページ: | 1 |
| 終了ページ: | 13 |
| 抄録: | The Inoue algorithm is a fundamental mathematical method for solving Sudoku puzzles by Boolean Groebner bases. We have been investigating the CII algorithm, which is a refined form of Inoue algorithm. Both of these algorithms are the mathematical version of "Try and Error method" for solving the puzzles by humans, and have been applied successfully to the evaluation of difficulty level of the puzzles. In this note, we study the correlation of several mathematical indicators of difficulty level such as SMYI, MDSL, s∞-rank and LAC by experiments. Especially, we have confirmed that the puzzles with infinite s∞-rank can be well hierarchically classified according to the difficulty level by LAC. |
| URI: | http://hdl.handle.net/2433/288944 |
| 出現コレクション: | 2255 Computer Algebra --Foundations and Applications |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。