6 papers
A New 0(klog n) Algorithm for Josephus Problem
Hikaru Manabe, Ryohei Miyadera, Yuji Sasaki +2
We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n)…
Maximum Nim and Josephus Problem algorithm
Shoei Takahashi, Hikaru Manabe, Ryohei Miyadera
In this study, we study a Josephus problem algorithm. Let be positive integers and , where $ \left\lfloor \ \ \right\rfl…
Maximum Nim and Josephus Problem
Shoei Takahashi, Hikaru Manabe, Ryohei Miyadera
In this study, we study the relation between Grundy numbers of a Maximum Nim and Josephus problem. Let f(x) = floor(x/k), where floor( ) is the floor function and k is a positive i…
Josephus Nim
Shoei Takahashi, Hikaru Manabe, Aoi Murakami +1
Here, we present a variant of Nim with two piles. In the first pile, we have stones with a weight of 1, and in the second pile, we have stones with a weight of -2. Two Players take…
Games of Nim with Dynamic Restrictions
Keita Mizugaki, Shoei Takahashi, Hikaru Manabe +2
The authors present formulas for the previous player's winning positions of two variants of restricted Nim. In both of these two games, there is one pile of stones, and in the firs…
Impartial and Partizan Restricted Chocolate Bar Games
Ryohei Miyadera, Shoei Takahashi, Aoi Murakami +2
In this paper, we consider impartial and partizan restricted chocolate bar games. In impartial restricted chocolate bar games, players cut a chocolate bar into two pieces along any…