Gold Miner Agent

A-Star algorithm pathfinding agent with self-calculated heuristics.

Java

The gist is that there's a gold block the miner must reach. The agent does not know where it is and can scan ahead of it to detect if it finds something. When it scans, it returns what that object is (Pit/Beacon/Gold) but it doesn't know where in that line it is.

The agent can also ONLY turn right and move forward.

The beacon helps return a value of where the gold is from the beacon in terms of Manhattan Distance, which makes the agent calculate a grid of squares where the gold might be.

Pits are tiles that makes the game over. The agent must avoid these tiles in order to reach the goal state.