このアイテムのアクセス数: 83
このアイテムのファイル:
| ファイル | 記述 | サイズ | フォーマット | |
|---|---|---|---|---|
| 2255-01.pdf | 6.03 MB | Adobe PDF | 見る/開く |
完全メタデータレコード
| DCフィールド | 値 | 言語 |
|---|---|---|
| dc.contributor.author | 中野, 哲夫 | ja |
| dc.contributor.author | 進藤, 未来 | ja |
| dc.contributor.author | 吉原, 元 | ja |
| dc.contributor.alternative | Nakano, Tetsuo | en |
| dc.contributor.alternative | Shindou, Miku | en |
| dc.contributor.alternative | Yoshihara, Tsukasa | en |
| dc.date.accessioned | 2024-07-25T05:20:57Z | - |
| dc.date.available | 2024-07-25T05:20:57Z | - |
| dc.date.issued | 2023-06 | - |
| dc.identifier.uri | http://hdl.handle.net/2433/288944 | - |
| dc.description.abstract | 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. | en |
| dc.language.iso | jpn | - |
| dc.publisher | 京都大学数理解析研究所 | ja |
| dc.publisher.alternative | Research Institute for Mathematical Sciences, Kyoto University | en |
| dc.subject.ndc | 410 | - |
| dc.title | Boolean Groebner 基底を用いた数独パズルの数学的難易度指標の相関について | ja |
| dc.title.alternative | On the correlation of some mathematical indicators of difficulty level of Sudoku puzzles in terms of Boolean Groebner bases (Computer Algebra : Foundations and Applications) | en |
| dc.type | departmental bulletin paper | - |
| dc.type.niitype | Departmental Bulletin Paper | - |
| dc.identifier.ncid | AN00061013 | - |
| dc.identifier.jtitle | 数理解析研究所講究録 | ja |
| dc.identifier.volume | 2255 | - |
| dc.identifier.spage | 1 | - |
| dc.identifier.epage | 13 | - |
| dc.textversion | publisher | - |
| dc.sortkey | 01 | - |
| dc.address | 東京電機大学理工学部 | ja |
| dc.address | 東京電機大学大学院理工学研究科 | ja |
| dc.address | 東京電機大学大学院理工学研究科 | ja |
| dc.address.alternative | Faculty of Science and Engineering, Tokyo Denki University | en |
| dc.address.alternative | Graduate School of Science and Engineering, Graduate School of Tokyo Denki University | en |
| dc.address.alternative | Graduate School of Science and Engineering, Graduate School of Tokyo Denki University | en |
| dcterms.accessRights | open access | - |
| datacite.awardNumber | 22K03275 | - |
| datacite.awardNumber.uri | https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-22K03275/ | - |
| dc.identifier.pissn | 1880-2818 | - |
| dc.identifier.jtitle-alternative | RIMS Kokyuroku | en |
| jpcoar.funderName | 日本学術振興会 | ja |
| jpcoar.awardTitle | 代数学の作用を受ける代数多様体の研究 | ja |
| 出現コレクション: | 2255 Computer Algebra --Foundations and Applications | |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。