If you look at that path in iterations 1-3, you see that it cuts through solid squares in two symmetric ways, in such a way that the next iteration's hole just barely misses it. Due to the fractal nature, this repeats with all subsequent iterations, infinitely.
The shortest path is 2×35≈1.4907
If you look at that path in iterations 1-3, you see that it cuts through solid squares in two symmetric ways, in such a way that the next iteration's hole just barely misses it. Due to the fractal nature, this repeats with all subsequent iterations, infinitely.