Introduction
My Diary
Contact

Ant Graph

The second part of this project: Implement a graph and graphical interface for creating graphs, implement ant path algorithms, implement other shortest path algorithms and compare. See here

Latest Simulation

Version 17.1

Versions 17 and 17.1 attempt to improve the move algorithm. It has been re-written, though still does not work successfully.

An auxiliary method called getNextGridSquare() is where the main calculations for the next movement happen. It is based on version 16, with modifications.

In this version ants do not follow trails back towards the nest successfully when they find food, this leads to trails all over the grid. Even so, some ants do make it back to the nest.

Source