{"created":"2025-01-19T00:40:11.980109+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00169421","sets":["1164:2735:8608:8853"]},"path":["8853"],"owner":"11","recid":"169421","title":["Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-07-18"},"_buckets":{"deposit":"d7aeb1b9-d042-40b7-9599-45a4c3f75098"},"_deposit":{"id":"169421","pid":{"type":"depid","value":"169421","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model","author_link":["340331","340334","340332","340333","340330","340329"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model"},{"subitem_title":"Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2016-07-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/169421/files/IPSJ-MPS16109003.pdf","label":"IPSJ-MPS16109003.pdf"},"date":[{"dateType":"Available","dateValue":"2018-07-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS16109003.pdf","filesize":[{"value":"555.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"da2b7842-3659-4750-834a-b50f50828e7b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hirofumi, Suzuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Sun, Hao"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shin-ichi, Minato"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hirofumi, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Sun, Hao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shin-ichi, Minato","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2016-07-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2016-MPS-109"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":169421,"updated":"2025-01-20T09:00:42.247404+00:00","links":{}}