Posted on:: October 28th, 2010
This is just too cool.
The Traveling Salesman Problem is a problem famous for being unintuitively difficult. The question is how you find the most efficient path among multiple geometric points. Sounds easy? With not too many destinations, it becomes outrageously difficult.
Except for bees.
Categories: misc, too big to know dw