Hex Strategy: Making the Right Connections
Hex Strategy is the first book to offer a comprehensive look at the game of Hex, from its history and mathematical underpinnings to discussions of advanced playing techniques. This is first and foremost a book on strategy aimed at providing sufficient knowledge to play the game at any level desired. Numerous examples illustrate an algorithmic approach to the game. Hex Strategy is a book for board game enthusiasts, recreational mathematicians and programmers, or simply those who enjoy games and puzzles.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Adjacency and Connectivity
Groups Steps and Paths
19 other sections not shown
Other editions - View all
0-connected spanning path 2-row ladder acute corner adjacent moves adjacent step algorithm best spanning path Black plays Black White block board position bridge move bridge pattern bridge step Brouwer's Fixed-Point Theorem cells central hexagon connectivity games consolidation Craige Schensted described disjoint edge template empty point set escape fork escape piece force a ladder Forced reply forcing move game of Hex Hex board Hex games Hex strategy hexagonal grid illustrated in Figure intrudes ladder escape foil ladder escape template ladder formation lookahead move at point new_paths new_steps opening move opponent opponent's overlap pivot points point q polyhexes possible potential ladder escape Puzzle safe group safely connected Sample Game second player Section sequence Shannon Switching Game shown in Figure shows singleton group strong swap option terminal point territory threat threatens to connect tiles top left edge top right edge Voronoi diagram vulnerable points weakest link White's best win the game