How did they design this game? Swish: complexity and unplayable positions - I-Site CAP 20-25 Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

How did they design this game? Swish: complexity and unplayable positions

Résumé

Swish is a competitive pattern recognition card-based game, in which players are trying to find a valid cards superposition from a set of cards, called a "swish". By the nature of the game, one may expect to easily recover the logic of the Swish's designers. However, even with a reverse engineering of Swish, no justification appears to explain the number of cards, of duplicates, but also under which circumstances no player can find a swish. In this work, we formally investigate Swish. In the commercial version of the game, we observe that there exist large sets of cards with no swish, and find a construction to generate large sets of cards without swish. More importantly, in the general case with larger cards, we prove that Swish is NP-complete.

Mots clés

Fichier principal
Vignette du fichier
LIPIcs.FUN.2024.10.pdf (798.34 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04489238 , version 1 (04-03-2024)
hal-04489238 , version 2 (18-06-2024)

Licence

Identifiants

Citer

Antoine Dailly, Pascal Lafourcade, Gael Marcadet. How did they design this game? Swish: complexity and unplayable positions. 12th International Conference on Fun with Algorithms (FUN 2024), Jun 2024, Island of La Maddalena, Sardinia, Italy, Italy. pp.10:1-10:19, ⟨10.4230/LIPIcs.FUN.2024.10⟩. ⟨hal-04489238v2⟩
43 Consultations
52 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More