{"updated":"2025-01-22T01:19:20.601228+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00065815","sets":["1:5760:5870"]},"path":["5870"],"owner":"10","recid":"65815","title":["チェッカー解明秘話"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-11-15"},"_buckets":{"deposit":"c81866a1-6407-4404-ad16-4e0676e9ab5a"},"_deposit":{"id":"65815","pid":{"type":"depid","value":"65815","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":"Episode on Solving Checkers","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"解説","subitem_subject_scheme":"Other"}]},"item_type_id":"1","publish_date":"2007-11-15","item_1_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"公立はこだて未来大学"}]},"item_1_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Future Univ. -Hakodate","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/65815/files/IPSJ-MGN481117.pdf"},"date":[{"dateType":"Available","dateValue":"2009-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MGN481117.pdf","filesize":[{"value":"763.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3a571542-aed2-44b5-8725-1071cf4e838d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_1_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岸本, 章宏"}],"nameIdentifiers":[{}]}]},"item_1_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akihiro, KISHIMOTO","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_1_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116625","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"article"}]},"item_1_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"よく知られたボードゲーム「チェッカー」は，両プレイヤが最善を尽くせば引き分けになることが，アルバータ大学（カナダ）のJonathan Schae er教授を中心とする研究チームによって，計算機を用いて証明された．本稿では，チェッカーの解明に利用した技術と筆者がプロジェクトの一員として参加した経緯，およびチェッカー解明までの道程について述べる．","subitem_description_type":"Other"}]},"item_1_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1263","bibliographic_titles":[{"bibliographic_title":"情報処理"}],"bibliographicPageStart":"1257","bibliographicIssueDates":{"bibliographicIssueDate":"2007-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"48"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:26:48.673460+00:00","id":65815,"links":{}}