{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00095546","sets":["6164:6805:6807:7288"]},"path":["7288"],"owner":"10","recid":"95546","title":["モンテカルロ木探索による数独少数ヒント盤面の生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-01-11"},"_buckets":{"deposit":"ed96cea3-cfd8-4789-9891-f04b37d960fe"},"_deposit":{"id":"95546","pid":{"type":"depid","value":"95546","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"モンテカルロ木探索による数独少数ヒント盤面の生成","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"モンテカルロ木探索による数独少数ヒント盤面の生成"},{"subitem_title":"Generation of Less-Clue Sudoku Boards by Monte-Carlo Tree Search","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"セッション8","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2013-01-11","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"高知工科大学大学院 工学研究科 基盤工学専攻"},{"subitem_text_value":"高知工科大学 情報学群"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, Kochi University of Tech-nology","subitem_text_language":"en"},{"subitem_text_value":"School of Information, Kochi University of Technology","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/95546/files/IPSJ-WPRO2013024.pdf"},"date":[{"dateType":"Available","dateValue":"2013-01-11"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-WPRO2013024.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2922f566-919a-4bd3-9dc2-25a2e4f004e6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"那須, 律政"},{"creatorName":"松崎, 公紀"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Norimasa, Nasu","creatorNameLang":"en"},{"creatorName":"Kiminori, Matsuzaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ペンシルパズルのうちでも，数独に対してさまざまな研究が行われている．そのうち，最少ヒント問題とは，唯一解を持つ盤面を構成できる最少のヒント数はいくつかという問題である．通常のサイズが9×9の数独については，2012年1月にMcGuireらによって，ヒント数16の盤面がない，すなわち，最少ヒントが17であることが示された．GPCCの2011年問題では，サイズが16×16の数独に対する最少ヒント問題がとりあげられ，そのなかで白川によってヒント数56の盤面が発見された．\n著者らもこの数独の少数ヒント問題に対して研究を行っている．数独の少数ヒント盤面を効率良く生成するには，広大な探索空間の中から適切に探索を行う必要がある．著者らは，ゲーム分野で近年活発に研究されているモンテカルロ木探索手法をこの問題に適用し，少数ヒント問題を効率良く生成することを目指している．本論文では，数独少数ヒント盤面生成にモンテカルロ木探索手法を適用するにあたり必要であった工夫と，得られた少数ヒント盤面について報告する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Among several pencil puzzles, Sudoku has been studied most intensively. A research problem on Sudoku is called the minimum number of clues problem: how many clues are necessary to construct a Sudoku board with a unique solution. For the usual 9 by 9 Sudoku, McGuire et al. showed on January 2012 that there is no 16-clue Sudoku board with a unique solution and the minimum number of clues is 17. In GPCC2011, it was a problem to find a board with a smaller number of clues for the 16 by 16 Sudoku, and Shirakawa found a 56-clue board. We also have studied on generation of these less-clue Sudoku boards. A challenge in the effective generation of less-clue Sudoku boards is to find those boards from a very broad search space. We have applied the monte-carlo tree search technique, which has been widely studied in game programming, to generate efficiently less-clue Sudoku boards. In this paper, we show how we apply the monte-carlo tree search technique to the generation of less-clue Sudoku boards. We also report the Sudoku boards that we have obtained in the experiments.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"180","bibliographic_titles":[{"bibliographic_title":"第54回プログラミング･シンポジウム予稿集"}],"bibliographicPageStart":"173","bibliographicIssueDates":{"bibliographicIssueDate":"2013-01-11","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2013"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"updated":"2025-01-21T13:47:00.033653+00:00","created":"2025-01-18T23:42:35.916345+00:00","links":{},"id":95546}