Nine unit circles are packed into a square, tangent to their neighbors and to the square. Consider the paths that connect two opposite corners of the square subject to the following conditions:
- The path is continuous
- The path is (once) differentiable, meaning that it doesn't change direction suddenly.
- The path may not touch or cross itself.
What is the length of the longest path?