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.

1 Comment »

You win an Order of Magnitude puzzle if your answer is within an order of magnitude of the right answer. On the other hand, you don’t actually win anything. So, here goes:

How many bees do you think are in a pound? (And isn’t the answer none if they’re all flying?)

How many bees per gallon?

The answer is in the comments. (Note: This is not a computation WolframAlpha can help you with.)

3 Comments »