38 citations · 64 across the 26 of their papers we have counts for
4 papers · 1 filter
Solvable Tuple Patterns and Their Applications to Program Verification
Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara +1
Despite the recent progress of automated program verification techniques, fully automated verification of programs manipulating recursive data structures remains a challenge. We in…
Misère Greedy Nim and Misère Bounded Greedy Nim
Nanako Omiya, Ryo Yoshinaka, Ayumi Shinohara
In this paper, we analyze the misère versions of two impartial combinatorial games: k-Bounded Greedy Nim and Greedy Nim. We present a complete solution to both games by showing nec…
BusOut is NP-complete
Takehiro Ishibashi, Ryo Yoshinaka, Ayumi Shinohara
This study examines the computational complexity of the decision problem modeled on the smartphone game Bus Out. The objective of the game is to load all the passengers in a queue…
StrNim: a variant of Nim played on strings
Shota Mizuno, Ryo Yoshinaka, Ayumi Shinohara
We propose a variant of Nim, named StrNim. Whereas a position in Nim is a tuple of non-negative integers, that in StrNim is a string, a sequence of characters. In every turn, each…