$\mathcal{P}$ Play in Candy Nim

18 May 2018Nitya ManiRajiv NelakantiSimon Rubinstein-SalzedoAlex Tholen

Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. We give bounds on the number of candies the first and second players obtain in 3-pile $\mathcal{P}$ positions as well as strategies that are provably optimal for some families of such games... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet