Streamlining of runNXT() and creation of runMotor(). runNXT() will now take a 1xn array of all points in the form [x1 y1 z1 x2 y2 z2] etc and move between them. Prim's algorithm (worked out as optimal for this particular problem) has not yet been implemented to decide the order in which the points are visited. Padding to move back to a certain height each time is also not yet included.