HexGraph: Applying Graph Drawing Algorithms to the Game of Hex

Murray, Colin and Friedrich, Carsten and Eades, Peter (2004) HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 494-495 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_47).

Full text not available from this repository.

Abstract

Hex [1] is a two player board game which is traditionally played on a rhombic hexagonal pattern (See Figure (1)). Players are assigned a colour and make moves by putting a token of their colour onto an empty field on the board. The first player to connect the two borders of the board in his colour by a path of his tokens on the board wins the game. Alternatively, Hex is played on an undirected, tricoloured (Red, Blue, Unclaimed) graph G [2]. The fields are represented by nodes and adjacent fields on the board are connected by an edge. The four borders of the board are represented by one node of equivalent colour each (See Figure(1)).

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-24595-7_47
Classifications:G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.490 Embeddings
P Styles > P.540 Planar
P Styles > P.300 Curved
ID Code:479

Repository Staff Only: item control page

References

C. Browne. Hex Strategy: Making the Right Connections. A. K. Peters, Natick, Massachusetts, 2000.

Jack and Rijswijck. Search and evaluation in Hex. Tech report, University of Alberta.

W.T. Tutte. Convex representations of graphs. Proc. Lond. Math. Soc., 10:304-320, 1960.

W.T. Tutte. How to draw a graph. Proc. London Math Soc., 13:743-768, 1963.

F. Bertault. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters, 74(1-2):7-13, 2000.

Carsten Friedrich. Animation in Relation Information Visualization. Phd thesis, University of Sydney, 2002.

P. Gould and R. White. Mental Maps. Allen and Unwin, Winchester, 1986.