A Winning Strategy for the Game of Antonim
Zachary Silbernick, Robert Campbell
TL;DR
This paper explores the game of Antonim, a Nim variant with unique heap size restrictions, providing a solution for three heaps and extending the theory to multiple heaps.
Contribution
It presents a solution for three-heap Antonim and generalizes the approach to any number of heaps, advancing understanding of this combinatorial game.
Findings
Solved the three-heap Antonim game
Generalized the solution to an arbitrary number of heaps
Provided strategic insights for playing Antonim
Abstract
The game of Antonim is a variant of the game Nim, with the additional rule that heaps are not allowed to be the same size. A winning strategy for three heap Antonim has been solved. We will discuss the solution to three-heap Antonim and generalize this theory to an arbitrary number of heaps.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Mathematics, Computing, and Information Processing