Generalizing OOOOOOB

We present three versions of the classic two-pile game one-or-one-or-one-of-both generalized to the multi-pile context.In each case, we explore the resulting P-positions.In the first version, there is a simple pattern.In the other two versions, we find partial solutions in each case through two experimental routes.We first limit the number of piles and then limit the number of tokens per pile.