Longest winning paths in Hex

TL;DR

The paper addresses the problem of identifying the longest winning path in Hex on an $n\\times n$ board and frames Hex as a two-player pursuit on a rhombic grid. It focuses on formalizing winning-path concepts and sets up the question of maximum path length as a core analytical objective. The excerpt indicates an intent to provide an answer to this longest-path question, establishing relevance to combinatorial game theory and path-structure analysis in Hex. Overall, the work aims to quantify inherent path-length limits in Hex and inform strategies related to long-winning routes.

Abstract

We answer the question: what is the longest winning path on a Hex board of size $n\times n$?