51 citations · 330 across the 30 of their papers we have counts for
4 papers · 1 filter
NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
Pakapim Eua-anant, Papangkorn Apinyanon, Thunyatorn Jirachaisri +2
All or Nothing, Water Walk, and Remembered Length are pencil puzzles that involve constructing a continuous loop on a rectangular grid under specific constraints. In this paper, we…
NP-Completeness Proofs of Puzzles using the T-Metacell Framework
Nattapol Kiatchaipipat, Suthee Ruangwises
Pencil puzzles are puzzles that can be solved by writing down solutions on a paper, using only logical reasoning. In this paper, we utilize the "T-metacell" framework developed by…
Simulating Virtual Players for UNO without Computers
Suthee Ruangwises, Kazumasa Shinagawa
UNO is a popular multiplayer card game. In each turn, a player has to play a card in their hand having the same number or color as the most recently played card. When having few pe…
Balance-Based Cryptography: Physically Computing Any Boolean Function
Suthee Ruangwises
Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols,…