Draw arbitrary points on the board and let the 🐜 "ant colony optimization" algorithm find and display the shortest path crossing all of your points.
This is known as the Travelling salesman problem.
robertlisaru/ant-colony-optimization
Draw arbitrary points on the board and let the 🐜 "ant colony optimization" algorithm find and display the shortest path crossing all of your points.
Java