Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
This is Nim in disguise because it is an impartial game. $(1,1)$ is a P position, so $(1,n)$ is P for $n$ odd, N for $n$ even$n \ge 2$. $(k,k)$ is P. $(2,3)$ is P. I suspect a relation with the Fibonacci series-find it. That is a wonderful book.
This is Nim in disguise because it is an impartial game. $(1,1)$ is a P position, so $(1,n)$ is P for $n$ odd, N for $n$ even. $(k,k)$ is P. $(2,3)$ is P. I suspect a relation with the Fibonacci series-find it. That is a wonderful book.
This is Nim in disguise because it is an impartial game. $(1,1)$ is a P position, so $(1,n)$ is N for $n \ge 2$. $(k,k)$ is P. $(2,3)$ is P. I suspect a relation with the Fibonacci series-find it. That is a wonderful book.
This is Nim in disguise because it is an impartial game. $(1,1)$ is a P position, so $(1,n)$ is P for $n$ odd, N for $n$ even. $(k,k)$ is P. $(2,3)$ is P. I suspect a relation with the Fibonacci series-find it. That is a wonderful book.
