The Travelling Salesman Problem is a classic problem in mathematics. The objective of the problem is to find the shortest possible route between a number of cities that visits each city only once and returns to the starting point. Below is a rendering of the text “MrReid.org” created by solving the Travelling Salesman Problem. If … Continue reading Making art with the Travelling Salesman Problem