In this challenge, we wanted to find the highest possible minimum number of lines needed to be traversed to travel between any 2 arbitrary points. For most points, this is 4. However, there are 2 for which it is 5. The answer is thus 5.
Solution to Maximum Seperation
