Not really because each point is only adjacent to a small neighborhood of other points, so if you want to test every possibility then your search space only gro

Not really because each point is only adjacent to a small neighborhood of other points, so if you want to test every possibility then your search space only grows by a constant factor proportional to the maximum degree of the graph. As for implementation complexity, you would hope they would use formal verification for something like this.