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.
Categories: misc, too big to know dw







You should check out Tom Seeley’s new book on honeybees–it’s terrific (and I’m not saying that because my old shop published it). It’s called Honeybee Demoracy.