TL;DR
This paper investigates the maximum length of winning paths in Hex boards of size n×n, providing insights into the game's strategic complexity.
Contribution
It introduces a method to determine the longest winning paths in Hex, addressing a fundamental combinatorial problem in the game.
Findings
Longest winning paths grow with board size
New bounds established for maximum path length
Implications for game strategy and complexity
Abstract
We answer the question: what is the longest winning path on a Hex board of size ?
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
TopicsScientific Computing and Data Management