Examples of our modified A Star algorithm (think the traveling salesman problem). The whole group will never repeat the same path solution as we have made each one have a different efficiency level when calculating solutions.
The more the simulation is run, however, the better each “person” gets in calculating the best solution.