TL;DR
Graph Nimors is a combinatorial game involving edge deletions and contractions on graphs, with the goal of being the last to make a move, and this paper explores its theoretical properties and experimental insights.
Contribution
The paper introduces new theoretical results and experimental data on Graph Nimors, advancing understanding of its strategic complexity and conjectures.
Findings
Characterization of winning positions
Experimental analysis of game outcomes
New conjectures on game complexity
Abstract
In the game of Graph Nimors, two players alternately perform graph minor operations (deletion and contraction of edges) on a graph until no edges remain, at which point the player who last moved wins. We present theoretical and experimental results and conjectures regarding this game.
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
TopicsGame Theory and Applications · Artificial Intelligence in Games · Gambling Behavior and Treatments