Papers › 𝒫 Play in Candy Nim
𝒫 Play in Candy Nim
Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo, Alex Tholen
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 𝒫 positions as well as strategies that are provably optimal for some families of such games. We also show how to construct a game with N candies such that the loser takes the largest possible number of candies and bound the number of candies the winner can take in an arbitrary 𝒫 position with N total candies.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections