Sankaku-tori: An old Western-japanese game played on a point set

Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)708-715
Number of pages8
JournalJournal of information processing
Volume25
DOIs
Publication statusPublished - Aug 2017

Fingerprint

Triangulation

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Sankaku-tori : An old Western-japanese game played on a point set. / Horiyama, Takashi; Iizuka, Takashi; Kiyomi, Masashi; Okamoto, Yoshio; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi; Yamauchi, Yukiko.

In: Journal of information processing, Vol. 25, 08.2017, p. 708-715.

Research output: Contribution to journalArticle

Horiyama, T, Iizuka, T, Kiyomi, M, Okamoto, Y, Uehara, R, Uno, T, Uno, Y & Yamauchi, Y 2017, 'Sankaku-tori: An old Western-japanese game played on a point set', Journal of information processing, vol. 25, pp. 708-715. https://doi.org/10.2197/ipsjjip.25.708
Horiyama T, Iizuka T, Kiyomi M, Okamoto Y, Uehara R, Uno T et al. Sankaku-tori: An old Western-japanese game played on a point set. Journal of information processing. 2017 Aug;25:708-715. https://doi.org/10.2197/ipsjjip.25.708
Horiyama, Takashi ; Iizuka, Takashi ; Kiyomi, Masashi ; Okamoto, Yoshio ; Uehara, Ryuhei ; Uno, Takeaki ; Uno, Yushi ; Yamauchi, Yukiko. / Sankaku-tori : An old Western-japanese game played on a point set. In: Journal of information processing. 2017 ; Vol. 25. pp. 708-715.
@article{6c3cb405b5024e2f8c1ba6dfa8de5c47,
title = "Sankaku-tori: An old Western-japanese game played on a point set",
abstract = "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.",
author = "Takashi Horiyama and Takashi Iizuka and Masashi Kiyomi and Yoshio Okamoto and Ryuhei Uehara and Takeaki Uno and Yushi Uno and Yukiko Yamauchi",
year = "2017",
month = "8",
doi = "10.2197/ipsjjip.25.708",
language = "English",
volume = "25",
pages = "708--715",
journal = "Journal of Information Processing",
issn = "0387-6101",
publisher = "Information Processing Society of Japan",

}

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

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

VL - 25

SP - 708

EP - 715

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-6101

ER -