{"id":73010,"updated":"2025-01-21T22:06:10.511212+00:00","links":{},"created":"2025-01-18T23:31:09.910196+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00073010","sets":["1164:5305:6345:6346"]},"path":["6346"],"owner":"10","recid":"73010","title":["計算ブロックパズルの生成アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-26"},"_buckets":{"deposit":"503bda08-7ffe-43f9-8d6c-14a7fde16c04"},"_deposit":{"id":"73010","pid":{"type":"depid","value":"73010","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":"How to Produce SumBlock Puzzle Instances","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-02-26","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"石巻専修大学理工学部"},{"subitem_text_value":"石巻専修大学理工学部"},{"subitem_text_value":"石巻専修大学理工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Science and Engineering, Ishinomaki Senshu University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science and Engineering, Ishinomaki Senshu University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science and Engineering, Ishinomaki Senshu University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/73010/files/IPSJ-GI11025006.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI11025006.pdf","filesize":[{"value":"163.3 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":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2f9f3218-a9bd-4e7d-b87d-0179e9663c27","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"安倍, 泰孝"},{"creatorName":"原口, 和也"},{"creatorName":"丸岡, 章"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasutaka, Abe","creatorNameLang":"en"},{"creatorName":"Kazuya, Haraguchi","creatorNameLang":"en"},{"creatorName":"Akira, Maruoka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11362144","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"計算ブロックパズルでは，与えられた n × n の盤面のブロックへの分割および各ブロックに対する自然数の割当に対し，ラテン方陣条件と部分和条件を満たすように，盤面上のすべてのセルに 1， 2，．．．，n の数を割り当てることが求められる．本研究では計算ブロックパズルの生成アルゴリズムを開発する．生成されるパズルの種類は，アルゴリズムに組込まれる推論規則によって調整される．被験者実験の結果，高度な推論規則を用いて生成されたパズルは，そうでないパズルより正答率が低いことが観察された．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For given partition of n × n grid into blocks and assignment of integers to the blocks, SumBlock puzzle asks to assign integers from {1, 2, . . . ,n} to all cells in the grid so that the completion satisfies the Latin square condition and the subset sum condition. In this research, we develop an algorithm to yield a SumBlock puzzle instance. Types of generated instances are adjusted by inference rules built into the algorithm. Our experimental studies show that human players are more likely to fail to solve the instances generated with sophisticated inference rules than those generated with easy inference rules.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2011-GI-25"}]},"relation_version_is_last":true,"weko_creator_id":"10"}}