In counted cross stitch, needleworkers are constantly solving the Traveling Salesman Problem (TSP). The TSP is important to many industries that depend on logistics and performing complex routing, such as shipping, computer chip manufacturing, and even DNA sequencing. This problem asks, “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?”
In cross stitch terms, “Given a chart with the location of stitches in color x and the distances between each pair of stitches, what is the most efficient route that uses the least amount of thread?”
Read more on the Rosemerry Writes blog.
