{"created":"2023-06-19T09:51:04.979732+00:00","id":8090,"links":{},"metadata":{"_buckets":{"deposit":"4ead75aa-1133-4236-b09e-8e4ac816596a"},"_deposit":{"created_by":3,"id":"8090","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"8090"},"status":"published"},"_oai":{"id":"oai:fukuyama-u.repo.nii.ac.jp:00008090","sets":["502:505:675:709"]},"author_link":["43385","43384","43386"],"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2001-12","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"90","bibliographicPageStart":"83","bibliographicVolumeNumber":"25","bibliographic_titles":[{"bibliographic_title":"福山大学工学部紀要"}]}]},"item_1_creator_6":{"attribute_name":"著者名(日)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"新谷, 敏朗"}],"nameIdentifiers":[{"nameIdentifier":"43384","nameIdentifierScheme":"WEKO"}]}]},"item_1_description_1":{"attribute_name":"ページ属性","attribute_value_mlt":[{"subitem_description":"P(論文)","subitem_description_type":"Other"}]},"item_1_description_12":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"Superpuzz is a solitaire game with one deck of cards and was adopted as a problem on GPCC in 1991. Superpuzz has a characteristic that Aces can move more freely than other cards in the game. So you cannot find a solution by adding a new node simply to the game tree because the same node will appear in the tree many times. I use a data structure called `Patricia' so that there is no duplication of nodes in the game tree. I have made clear that it is possible to search the game tree entirely up to the case of the half size (6 columns) on a typical computer for personal use. In this paper, I found that the number of nodes searched in a priority-first search is less than those in the simple depth-first search in average case. The priority adopted here is decided from the nature of the game that the nearer is a node to the state of success, the more Aces are on the right-most column. It is expected that the number of nodes which will be searched until the first solution is found will be about 108 in case of the full-size Superpuzz.","subitem_description_type":"Other"}]},"item_1_full_name_7":{"attribute_name":"著者名よみ","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"43385","nameIdentifierScheme":"WEKO"}],"names":[{"name":"シンタニ, トシオ"}]}]},"item_1_full_name_8":{"attribute_name":"著者名(英)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"43386","nameIdentifierScheme":"WEKO"}],"names":[{"name":"SHINTANI, Toshio","nameLang":"en"}]}]},"item_1_source_id_13":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AN00217655","subitem_source_identifier_type":"NCID"}]},"item_1_text_10":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Faculty of Engineering, Fukuyama University"}]},"item_1_text_9":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_value":"福山大学工学部情報処理工学科"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2001-12-01"}],"displaytype":"detail","filename":"KJ00005781471.pdf","filesize":[{"value":"738.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fukuyama-u.repo.nii.ac.jp/record/8090/files/KJ00005781471.pdf"},"version_id":"cf317cfa-3d99-4d94-8466-4aacd998c6e9"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"スーパーパズ","subitem_subject_scheme":"Other"},{"subitem_subject":"探索","subitem_subject_scheme":"Other"},{"subitem_subject":"順位優先","subitem_subject_scheme":"Other"},{"subitem_subject":"GPCC","subitem_subject_scheme":"Other"},{"subitem_subject":"Superpuzz","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Search","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Priority-first","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"GPCC","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"スーパーパズにおける順位優先探索","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"スーパーパズにおける順位優先探索"},{"subitem_title":"Priority-first Search in Superpuzz","subitem_title_language":"en"}]},"item_type_id":"1","owner":"3","path":["709"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-12-01"},"publish_date":"2001-12-01","publish_status":"0","recid":"8090","relation_version_is_last":true,"title":["スーパーパズにおける順位優先探索"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-06-19T10:30:24.559998+00:00"}