This program simulates a gold miner, an intelligent agent, on a rectangular grid of n x n squares. N can be any number from 8 to 32. The gold miner always start at the upper left-hand corner of the grid. Somewhere on the grid is a square that contains the gold. The gold miner finds its way to the golden square, and the shorter the path travelled, the more rational the agent is
Start Screen
Configuring the map
The miner finding its way to the gold
A group work with 3 members. A requirement for the course, Intelligent Systems. Responsible for the design and its interaction with the algorithm. Programmed using Java.
