Joho the Blog » np

October 28, 2010

Have you heard the one about the bees and the traveling salesman?

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 Tagged with:  •  Date: October 28th, 2010

1 Comment »