2024-03-28T23:15:09Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:001830072022-10-21T05:24:51Z00581:08997:09006
Achievement Games on a One-dimensional BoardAchievement Games on a One-dimensional Boardeng[特集:離散と計算の幾何・グラフ・ゲーム] achievement games, Harary's generalized tic-tac-toe, paving winner, one-dimensional boardhttp://id.nii.ac.jp/1001/00182919/Journal Articlehttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=183007&item_no=1&attribute_id=1&file_no=1Copyright (c) 2017 by the Information Processing Society of JapanKyoto UniversityKoki, SuetsuguAchievement games are usually played and studied for polynominos which are commonly called animals, and it is known whether each animal is a winner or a loser, except for one animal called Snaky. In this paper, we study achievement games for unconnected shapes which we call creatures. We mostly discuss them on a one-dimensional board, because they exhibit interesting behavior even in this simple setting. We determined whether a creature is a winner or a loser for those composed of no more than three stones. Furthermore, we proved there is an arbitrary large paving winner.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.678------------------------------Achievement games are usually played and studied for polynominos which are commonly called animals, and it is known whether each animal is a winner or a loser, except for one animal called Snaky. In this paper, we study achievement games for unconnected shapes which we call creatures. We mostly discuss them on a one-dimensional board, because they exhibit interesting behavior even in this simple setting. We determined whether a creature is a winner or a loser for those composed of no more than three stones. Furthermore, we proved there is an arbitrary large paving winner.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.678------------------------------AN00116647情報処理学会論文誌5882017-08-151882-77642017-08-10