Part II: Using Eddystones as Land Mines in a Simulated Military Game

In case you missed the first part, here is the link: Part I

The High Level Implementation

Based on the above picture, we have 4 eddystone beacons at hand and our main goal is to arrange them so that the enemy will have a very hard time in surviving by avoiding the landmines which when he stays within range, of the landmine, it explodes. Arranging the landmines can have a lot of possibilities. This problem is almost the same as the Traveling Salesman Problem but our goal is to generate a solution where the salesman has to travel the longest possible time. Yes, there should be a way for the salesman(enemy) to at least survive the test.

Figure 1: shows the high level solution applying Simulated Annealing Algorithm. It has mentioned the different algorithms that will be used. 

Further Reading:
The 2 Dimensional Random Pattern Generator Algorithm may be adapted to generate the arrangement of the eddystone beacons.
The different algorithm for solving the maze pattern can be found in wikipedia