TY - JOUR
T1 - Sankaku-tori
T2 - An old Western-japanese game played on a point set
AU - Horiyama, Takashi
AU - Iizuka, Takashi
AU - Kiyomi, Masashi
AU - Okamoto, Yoshio
AU - Uehara, Ryuhei
AU - Uno, Takeaki
AU - Uno, Yushi
AU - Yamauchi, Yukiko
N1 - Funding Information:
Acknowledgments This work was supported by JSPS/MEXT KAKENHI Grant Numbers 23300001, 24106004, 24106007, 24220003, 24106005, 24700008, 26330009, 15H00853, 15K00008, 15K00009, 15K15938, and JST CREST Foundation of Innovative Algorithms for Big Data. The fifth author thanks his mother for playing the game with him many times, and she tells him about this game played in the west of Japan.
Funding Information:
This work was supported by JSPS/MEXT KAKENHI Grant Numbers 23300001, 24106004, 24106007, 24220003, 24106005, 24700008, 26330009, 15H00853, 15K00008, 15K00009, 15K15938, and JST CREST Foundation of Innovative Algorithms for Big Data. The fifth author thanks his mother for playing the game with him many times, and she tells him about this game played in the west of Japan.
Publisher Copyright:
© 2017 Information Processing Society of Japan.
PY - 2017/8
Y1 - 2017/8
N2 - We study a combinatorial game named '‘sankaku-tori’' in Japanese, which means '‘triangle-taking’' in English. It is an old pencil-and-paper game for two players played in Western Japan. The game is played on points on the plane in general position. In each turn, a player adds a line segment to join two points, and the game ends when a triangulation of the point set is completed. The player who completes more triangles than the other wins. In this paper, we formalize this game and investigate three restricted variants of this game. We first investigate a solitaire variant; for a given set of points and line segments with two integers t and k, the problem asks if you can obtain t triangles after k moves. We show that this variant is NP-complete in general. The second variant is the standard two player version, but the points are in convex position. In this case, the first player has a nontrivial winning strategy. The last variant is a natural extension of the second one; we have the points in convex position but one point inside. Then, it turns out that the first player has no winning strategy.
AB - We study a combinatorial game named '‘sankaku-tori’' in Japanese, which means '‘triangle-taking’' in English. It is an old pencil-and-paper game for two players played in Western Japan. The game is played on points on the plane in general position. In each turn, a player adds a line segment to join two points, and the game ends when a triangulation of the point set is completed. The player who completes more triangles than the other wins. In this paper, we formalize this game and investigate three restricted variants of this game. We first investigate a solitaire variant; for a given set of points and line segments with two integers t and k, the problem asks if you can obtain t triangles after k moves. We show that this variant is NP-complete in general. The second variant is the standard two player version, but the points are in convex position. In this case, the first player has a nontrivial winning strategy. The last variant is a natural extension of the second one; we have the points in convex position but one point inside. Then, it turns out that the first player has no winning strategy.
UR - http://www.scopus.com/inward/record.url?scp=85040916738&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85040916738&partnerID=8YFLogxK
U2 - 10.2197/ipsjjip.25.708
DO - 10.2197/ipsjjip.25.708
M3 - Article
AN - SCOPUS:85040916738
SN - 0387-6101
VL - 25
SP - 708
EP - 715
JO - Journal of Information Processing
JF - Journal of Information Processing
ER -