Hexomania is a strategic game for two players (or one player against the computer). It also supports TCP/IP in order to play against a remote opponent over the Internet.

About the Game

Each player must try to build a path from one end of the board to the other one: the green player from the top left side to the bottom right one, the red player from the top right side to the bottom left one. The players are allowed to set on any field that is still free. Although the rules are simple, the game is not easy to play. One wrong move and you'll lose.

The game uses the Apple Speech Manager (if installed) to speak the computer moves. Netplay is possible if Open Transport or TCP/IP is installed.

System Requirements

•A Macintosh (or Power Macintosh) with 4MB of memory

•A color display (256 colors or grays) or more

•1.5MB of hard disk space

•System 7.5 or higher

•Optional: Speech Manager (for speech), Open Transport (for net play)

Hexomania does not run on Intel Macs.

New: Version 1.1

Network play has been extensively tested/debugged.
Color-blind people can now swap between green/red or blue/red stone sets.


To download version 1.1, click here (bin-hexed, about 1.1MB) or here (bin-hexed and gzipped, about 850k).

Game History

Thanks to the feedback of Ingemar Ragnemalm, I can now tell you more about the history of Hexomania:

It seems like the game, which used to be called Hex, is known since about 50 years now, and that it has been analysed by lots of people. It is proven that the first player has a theoretical win, but the proof does not indicate how.

The following publications have been written about Hex:

•Martin Gardner. The Scientific American Book of Mathematical Puzzles and Diversions. Simon and Schuster 1959.

•S. Even and R. E. Tarjan. A Combinatorial Problem Which Is Complete in Polynomial Space. Journal of the Associaction for Computing Machinery, volume 23 number 4, October 1976.

•David Gale. The Game of Hex and the Brouwer Fised-point Theorem. American Mathematical Monthly, number 86, 1979.

•Stefan Reisch, Hex ist PSPACE-vollstaendig. Acta Informatica, volume 15, pp. 167-191, 1981.

A FAQ file on Hex can be found at http://www.cs.cmu.edu/~hde/hex/hexfaq