easier testing: start from the straight solution

[[Imported from SVN: r5479]]

rodobstacle.cc

@@ -149,8 +149,12 @@ int main (int argc, char *argv[]) try
     // //////////////////////////
     //   Initial solution
     // //////////////////////////
-    x = 0;
-    x[x.size()-1][2] = 2*M_PI;
+
+    for (int i=0; i<x.size(); i++) {
+        x[i][0] = 1.0/(x.size()-1);
+        x[i][1] = 0;
+        x[i][2] = 0;
+    }
 
 
     // /////////////////////////////////////////////////////////////////////