{"created":"2025-01-19T01:45:06.566867+00:00","updated":"2025-01-19T07:52:45.408845+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240746","sets":["6164:6165:6210:11853"]},"path":["11853"],"owner":"44499","recid":"240746","title":["Number Solitaire Game HyperSpaceWorm"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-15"},"_buckets":{"deposit":"947e994a-780a-4d80-ae01-6b81f016763c"},"_deposit":{"id":"240746","pid":{"type":"depid","value":"240746","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Number Solitaire Game HyperSpaceWorm","author_link":["661010","661013","661008","661009","661011","661012"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Number Solitaire Game HyperSpaceWorm"},{"subitem_title":"Number Solitaire Game HyperSpaceWorm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Hyperspace search","subitem_subject_scheme":"Other"},{"subitem_subject":"puzzle game","subitem_subject_scheme":"Other"},{"subitem_subject":" searching algorithm","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-11-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Dept. Of Computer Science and Information Engineering, National Dong Hwa University"},{"subitem_text_value":"National Taiwan Normal University"},{"subitem_text_value":"National Taipei University"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Dept. Of Computer Science and Information Engineering, National Dong Hwa University","subitem_text_language":"en"},{"subitem_text_value":"National Taiwan Normal University","subitem_text_language":"en"},{"subitem_text_value":"National Taipei University","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/240746/files/IPSJ-GPWS2024028.pdf","label":"IPSJ-GPWS2024028.pdf"},"date":[{"dateType":"Available","dateValue":"2024-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2024028.pdf","filesize":[{"value":"666.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"54f83e00-3d42-4e1f-be4d-01c3dd2dd9e5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shi-Jim, Yen"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yu-Shan, Yen"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jr-Chang, Chen"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shi-Jim, Yen","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yu-Shan, Yen","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jr-Chang, Chen","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":"This paper proposes a hyperspace puzzle game, and writes a problem-solving program. Because this game process is similar to worms occupying a hyperspace, it is named HyperSpaceWorm (M, N, P). The space of this game is M-dimensional, the size of each dimension is N, and the P value determines the length and number of the number sequence to be completed. The purpose of the game is to fill up the entire multi-dimensional space with these worm-like numerical sequences in sequence. We can adjust M, N, and P to change the difficulty of the game and create levels to make the game more interesting. This game process can train the concept of hyperspace and spatial thinking ability, and can also set up a large number of levels with different difficulties, which has considerable potential.","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes a hyperspace puzzle game, and writes a problem-solving program. Because this game process is similar to worms occupying a hyperspace, it is named HyperSpaceWorm (M, N, P). The space of this game is M-dimensional, the size of each dimension is N, and the P value determines the length and number of the number sequence to be completed. The purpose of the game is to fill up the entire multi-dimensional space with these worm-like numerical sequences in sequence. We can adjust M, N, and P to change the difficulty of the game and create levels to make the game more interesting. This game process can train the concept of hyperspace and spatial thinking ability, and can also set up a large number of levels with different difficulties, which has considerable potential.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"194","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2024論文集"}],"bibliographicPageStart":"192","bibliographicIssueDates":{"bibliographicIssueDate":"2024-11-15","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":240746,"links":{}}