A solution to the Travelling Salesman Problem can be used to find the shortest pub crawl around Oxford, but a regular solution wouldn't account for a key problem: the more you drink, the slower you walk. The goal of this challenge is to find the shortest pub crawl that accounts for this slowdown, and we may add some extra restrictions later ;).
To get started, clone the repository or download a copy of it and run either
python3 alpha_order.py or python3 randomised.py to get an idea of what you
have to do.