{"updated":"2025-01-20T06:44:10.727425+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00142067","sets":["581:7706:7711"]},"path":["7711"],"owner":"11","recid":"142067","title":["Winning Strategies in Multimove Chess (i,j)"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-05-15"},"_buckets":{"deposit":"ab120d37-7b23-492e-942a-6e7090e341a6"},"_deposit":{"id":"142067","pid":{"type":"depid","value":"142067","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Winning Strategies in Multimove Chess (i,j)","author_link":["209479","209478","209477","209480"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Winning Strategies in Multimove Chess (i,j)"},{"subitem_title":"Winning Strategies in Multimove Chess (i,j)","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：娯楽の離散数理] chess, chess with multiple moves per turn, chess variants, chess problems, Marseillais chess","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2015-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Massachusetts Institute of Technology"},{"subitem_text_value":"Massachusetts Institute of Technology"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Massachusetts Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Massachusetts Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/142067/files/IPSJ-JNL5605007.pdf","label":"IPSJ-JNL5605007"},"date":[{"dateType":"Available","dateValue":"2017-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5605007.pdf","filesize":[{"value":"74.9 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"72e79394-61de-474f-b974-772bf1d02f57","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"EmilyRita, Berger"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Alexander, Dubbs"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Emily, RitaBerger","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Alexander, Dubbs","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We propose a class of chess variants, Multimove Chess (i,j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent's king. All other rules of chess apply. We prove that if (i,j) is not (1,1) or (2,2), and if i ≥ min(j,4), then White always has a winning strategy, and if i < (j,4), Black always has a winning strategy.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.272\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a class of chess variants, Multimove Chess (i,j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent's king. All other rules of chess apply. We prove that if (i,j) is not (1,1) or (2,2), and if i ≥ min(j,4), then White always has a winning strategy, and if i < (j,4), Black always has a winning strategy.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.272\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2015-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"56"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":142067,"created":"2025-01-19T00:19:34.003672+00:00"}