Hexomania - A Game for Hexagons

• Download source code - 35.3 KB
• Download demo project - 13.6 KB

Introduction

Hexomania is a strategy game that I've made and wanted to share with you. It contains a good AI for the computer play. I think this is a good example of what you can do with C#. It took 2 days for programming.

How to Play

Every player has a lot of pieces and some targets (circles) with the same color. The game is played in turns. Targets move randomly one step, every turn. You win if all his targets are imprisoned (can't move). You play by moving any of your pieces to an empty hex that is adjacent to another one of your pieces.

Click a piece to move. Click an empty hex to put the piece. You can change the board size (and number of pieces and targets of course). You can change the number of players.

I hope you enjoy the game.

The Game Classes Consists Of

• Board: which saves information about almost everything (hex cells, ArrayList of teams), and also handles the drawing of the board. Contains some functions to help AI cost calculations per team (Form1 contains the actual AI that uses this function).
• Team: which saves information about player name, control (human, CPU), and saves the targets positions of this player. (Note that the players pieces are saved in the board array.)
• Form1: The main form of the game and handles mouse clicks for the users and some of the computer playing turn (AI)

The Computer AI

The AI is simple enough. It consists of the function Board.Cost(team) which calculates the cost for the current position of the board for a certain player. Based on the sum of free spaces around every target of the player. This means that the player wins when the Cost returns 0.

The Cost function works by creating a tmp array with the same size of the board, that initially contains zeros. Then search around every target of the player and add for every free space a certain amount of cost in the tmp array. This amount is big when the position is near the target, and small when far from it because we want the computer to fill the free space around the target. Then the Cost function returns the sum of all the tmp array.

For the computer to play its turn, it searches for the piece that can be removed producing the minimum cost. Then searches for the best position to put that piece in, based on (again) the minimum cost produced.

The search is done on all the available pieces to remove, then on all the free spaces that are adjacent to other pieces, to select a place to put on.

How to Save a Hex Grid in an Array

It is done by a normal 2 dimensional array. But the y positions are spaced by a half grid below, every Xindex mod 2 = 1, to create the hex shape. The next shape shows how we calculate the x,y index of the array:

History

• 14^th April, 2004: Initial version

License

This article has no explicit license attached to it, but may contain usage terms in the article text or the download files themselves. If in doubt, please contact the author via the discussion board below. A list of licenses authors might use can be found here.