Murray, Colin and Friedrich, Carsten and Eades, Peter (2004) HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. [Conference Paper]
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 |
|---|---|
| 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 |
| Deposited By: | Selbach, Anna |
| Deposited On: | 09 Dec 2004 |
| Last Modified: | 25 Jan 2010 11:20 |
| Alternative Locations: | http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2912&spage=494 |
Repository Staff Only: item control page
