Skip to content

Latest commit

 

History

History
11 lines (11 loc) · 1.07 KB

File metadata and controls

11 lines (11 loc) · 1.07 KB
██╗     ███████╗███╗   ███╗      ██╗███╗   ██╗
██║     ██╔════╝████╗ ████║      ██║████╗  ██║
██║     █████╗  ██╔████╔██║█████╗██║██╔██╗ ██║
██║     ██╔══╝  ██║╚██╔╝██║╚════╝██║██║╚██╗██║
███████╗███████╗██║ ╚═╝ ██║      ██║██║ ╚████║
╚══════╝╚══════╝╚═╝     ╚═╝      ╚═╝╚═╝  ╚═══╝
You must move your ant colony from one point to another in the least amount of time. 
Through this project, you will explore graph traversal algorithms: 
your program will have to choose the paths and moves to be taken by the ants.
Final grade = 125/100

lemin