shing to find the shortest route between all the cities in which he had customers. The complexity of this problem rises much faster than the Rice and Chess Board problem. Try it for yourself. It doesn’t matter if you imagine you are visiting customers or shops. I have given you a grid to count off distances. T