一个简单的找路的程序：假设平面上有几个半径相等的圆，从下边界开始，沿着圆前进，当两个圆相切的时候，可以继续前进。最后看是否能够到达上边界。 下边的这个程序是最简单的一种情况，即只用一个连通的路径存在的情况。

-A simple procedure for finding the way: Suppose the plane equal to the radius of the circle there are several, starting from the boundary along the round forward, when the two circles tangent, they can move on. Finally, see if it can reach the boundary. Below this procedure is the simplest case, that is only connected with a path exist.