Advertise here with Carbon Ads

This site is made possible by member support. ๐Ÿ’ž

Big thanks to Arcustech for hosting the site and offering amazing tech support.

When you buy through links on kottke.org, I may earn an affiliate commission. Thanks for supporting the site!

kottke.org. home of fine hypertext products since 1998.

๐Ÿ”  ๐Ÿ’€  ๐Ÿ“ธ  ๐Ÿ˜ญ  ๐Ÿ•ณ๏ธ  ๐Ÿค   ๐ŸŽฌ  ๐Ÿฅ”

Visualization of the travelling salesman problem

The traveling salesman problem is a classic in computer science. It sounds deceptively easy: given any number of cities, determine the shortest path a traveling salesman would have to travel to visit them all. This video shows how the “obvious” solution โ€” “well, just start somewhere and always visit the next closest town!” โ€” doesn’t hold up well against other approaches. (via @coudal)