Peter Diefenbach: Conquest

An easy round-based strategy game. To win, destroy or circle the enemy, so he/she has no chance to move. Two players can play against each other, but you can also play against the computer (and choose between two strategies), or you can even just watch the computer playing against itself.

Part of the fun is that the game offers different topologies with different neighboring relations between the fields. And this influences the strategy you should apply.

How to start the program

No matter what option you choose: You need a Java Runtime Environment on your computer. The easiest way is to get it from There you can also check if you already have it installed.

A word to the programmers among you

If you want, you can download the source code.

The source is meant as example on object-oriented design principles. It started as sample solution for programming exercises.

Feel free to use the files in your own projects, as long as you name me and all other contributors to the files you took in use.
If you apply changes to my files, please inform me of the result, maybe there are more interested in your improvements.

And here's the manual:


A round based strategy game.

Table of Content

The Rules

Two players play against each other on a board. The board contains fields, which could be holes (black), free (gray), or occupied by one of the players (red or green).

The goal is to circle the opponent player in a way that he can't move. The players move in turns. A move can be:

No matter if growing or moving—all fields in the direct neighborhood of the destination field owned by the opponent are conquered and then belong to the current player.

A player has to do a move. If he cannot move, he has lost the game.


In this game the neighborhood relationship between fields is important. That's why there are several boards with different topologies.

Rule of thumb: The more neighbors, the harder it to circle the opponent.


The current player is displayed below. The last half-move of the opponent is displayed by a cirle and a line. If the current player is human, the move can be entered the following way:

  1. The user clicks into a field that is owned by him. That's the starting field. The board marks all fields that can be reached from there by growing or moving.
  2. The user clicks on one of the marked destination fields.

To clear the selection of the starting field, click somewhere else on the board. If a human player plays against a computer strategy, the computer player moves automatically. If two computer strategies play against each other, the user has to click somewhere onto the board for each move of each player. So he can watch the game at his own pace.

The Menu


Actions for the whole game or program.


Exits the current game and starts a new one.


Switches the language for the whole program.

Deutsch (Deutschland)
English (United States)

Quits the program.


Some information about the program.


Displays some help about this program.


Displays information about this program.

Start a new game

When you start a new game, you have several options to adapt the game to your needs.


Chooses the board (including topology).

Player red

Selects the player type for player red.

Player green

Selects the player type for player green.

Player types

The player type defines how a player is part of the game.


A human player in front of the computer, playing by mouse.

Computer strategy random

A very easy, but unforeseeable computer player.

Computer strategy greedy

An easy computer player, looking mainly for short term gains of controlled area.

Computer strategy minimax

A still beatable computer player, able to look ahead some moves.