This challenge utilizes the concepts of basic graph theory and counting.
The challenge is to find the highest possible minimum number of lines needed to be traversed to get between any 2 arbitrary points.
Maximum Seperation
Challenges cover a variety of topics
This challenge utilizes the concepts of basic graph theory and counting.
The challenge is to find the highest possible minimum number of lines needed to be traversed to get between any 2 arbitrary points.