In the Voronoi Game two or more players alternatingly place sites on a bounded gaming arena. After a given number of rounds, the voronoi diagram of all sites is calculated and the player whose voronoi regions occupy the most area is considered the winner.
Winning-strategies are known for the one-dimensional game as well as the one-round game on a rectangular arena, where the players place all their sites in one single round. However, not much is known about games on more complex arenas or multi-round games in dimensions higher than 1, but the game seems to be intractable in general.
In this Java Applet you can try yourself on the two-dimensional multi-round Voronoi Game on arbitrary convex-polygonal arenas, against a number of more or less sophisticated computer strategies.
The Java Applet and the computer strategies were developed as a diploma thesis by Jens Anuth, supervised by Dr. Christian Icking and Dr. Lihong Ma at Fernuni Hagen, 2007.
Comments may be sent to jens464 at gmail.com