This video describes the end colony algorithm for searching the shortest path in LPSS. Imagine an ant has directions to choose in a library, although sometimes it just choose away randomly. It were more likely to choose the direction with more fereumum, which is a kind of marking smell. And the ant will also release its own smell when moving. The smell of each ant will be lighter and lighter as time goes on. Each part of path will be forgotten unless another ant passes it. Since the short-term path costs less time, it has higher probability to maintain the smell, so that it can lead the next ant. So the fereum on each path has constant volatile rate. The longer the path is, the more fereumum will be volatile. So, shorter path always has a higher probability to rest do more fereumum. And that is why we can finally get the shortest path. Thank you for watching.