Document Type
Article
Publication Date
3-1-2007
Published In
Integers
Abstract
In n x ∞ Hex the player whose task is to complete a finite path can win, but the other player can ensure that any winning path contains at least n + [n−2/4] cells.
Recommended Citation
Walter Stromquist.
(2007).
"Winning Paths In N-By-Infinity Hex".
Integers.
Volume 7,
https://works.swarthmore.edu/fac-math-stat/33