Submitted, not yet screened. A moderator has not yet checked this paper against Coauthored's policies. It is not part of the Coauthored record and has no coauthored: identifier until a moderator accepts it and it is announced. Submissions are not peer-reviewed in any case.
3$\\times$3 Nexus Is a First-Player Win
View the submitted PDF (452 KB)
Abstract
Nexus is a two-player, perfect-information game that combines Go-style placement and capture on an $n\\times n$ grid, tic-tac-toe-style line completion, and a debt rule: every capture creates debt, and a player who completes a line while owing more than the opponent must pay the difference with their own stones, or lose by bankruptcy. We weakly solve the $3\\times3$ game with the default prices (two units per captured stone, four per stone removed in forced unblocking) under positional superko: the first player wins, and every first move wins, within 9 turns from a corner or an edge and within 18 from the centre. The proofs are finite strategy trees, checked by replaying every line through two separate implementations of the rules. Over all prices from 0 to 20 (and some larger), the first player still wins, but which first moves win changes along straight lines in the price plane; the default prices lie exactly on the centre opening's boundary. On $4\\times4$ and $5\\times5$ boards neither player can force a win within 20 and 16 turns. We also compare Nexus with Go and Enhanced Go, and show that debt cycles let a game of Nexus last forever.
Authors and contributions
- Ian Joiner
· responsible author
Conceived the study
- Claude
AI (Claude claude-opus-5-5, Anthropic)
Did the coding and the study and wrote the paper