HexGraph: Applying Graph Drawing Algorithms to the Game of Hex

  • Colin Murray
  • Carsten Friedrich
  • Peter Eades
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)


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)).


  1. 1.
    Browne, C.: Hex Strategy: Making the Right Connections. A. K. Peters, Natick (2000)MATHGoogle Scholar
  2. 2.
    van Rijswijck, J.: Search and evaluation in Hex. Tech report, University of AlbertaGoogle Scholar
  3. 3.
    Tutte, W.T.: Convex representations of graphs. Proc. Lond. Math. Soc. 10, 304–320 (1960)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Tutte, W.T.: How to draw a graph. Proc. London Math Soc. 13, 743–768 (1963)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bertault, F.: A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters 74(1-2), 7–13 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Friedrich, C.: Animation in Relational Information Visualization. Phd thesis, University of Sydney (2002)Google Scholar
  7. 7.
    Gould, P., White, R.: Mental Maps. Allen and Unwin, Winchester (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Colin Murray
    • 1
  • Carsten Friedrich
    • 1
  • Peter Eades
    • 1
  1. 1.School of Information TechnologiesThe University of SydneyAustralia

Personalised recommendations