Computational Complexity of Swish
Abstract
Swish is a card game in which players are given cards having symbols (hoops and balls), and find a valid superposition of cards, called a "swish." Dailly, Lafourcade, and Marcadet (FUN 2024) studied a generalized version of Swish and showed that the problem is solvable in polynomial time with one symbol per card, while it is NP-complete with three or more symbols per card. In this paper, we resolve the previously open case of two symbols per card, which corresponds to the original game. We show that Swish is NP-complete for this case. Specifically, we prove the NP-hardness when the allowed transformations of cards are restricted to a single (horizontal or vertical) flip or 180-degree rotation, and extend the results to the original setting allowing all three transformations. In contrast, when neither transformation is allowed, we present a polynomial-time algorithm. Combining known and our results, we establish a complete characterization of the computational complexity of Swish with respect to both the number of symbols per card and the allowed transformations.
Cite
@article{arxiv.2601.09289,
title = {Computational Complexity of Swish},
author = {Takashi Horiyama and Takehiro Ito and Jun Kawahara and Shin-ichi Minato and Akira Suzuki and Ryuhei Uehara and Yutaro Yamaguchi},
journal= {arXiv preprint arXiv:2601.09289},
year = {2026}
}
Comments
10 pages, 5 figures