Open ghost opened 6 years ago
This is a(n):
Details: Probabilistic multi-agent algorithm for shortest-pathfinding in graphs. Should this go in AI, graph algorithms, or somewhere else? I will start with Java.
For a reference to an existing implementation in C++, we implemented Ant-TSP couple of years ago
I would like to work on this issue.
This is a(n):
Details: Probabilistic multi-agent algorithm for shortest-pathfinding in graphs. Should this go in AI, graph algorithms, or somewhere else? I will start with Java.