```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 ``` ```/* SI 335 Spring 2013  * Project 3  * YOUR NAME HERE  */   #include #include #include #include using namespace std;   /* This function takes in a 2D-array that stores a maze description,    and returns a list of "moves" to make in order to solve the maze.  */ vector calcMoves(vector< vector >& maze) {   // THIS IS THE FUNCTION YOU NEED TO RE-WRITE!   // Width and height calculated from maze size, minus borders   int w = maze.size() - 2;   int h = maze[0].size() - 2;     // Start (curY, curX) at the starting position   int curY = 1;   int curX = 0;     // The solution here is terrible: it just randomly mills about until   // it happens upon the end or it runs out of points.   vector moves;   while (moves.size() < 4*h*w) {     int nextY = curY;     int nextX = curX;     char nextMove;     // randomly choose a direction     if (rand() % 2 == 0) {       // go left/right       if (rand() % 2 == 0) {         nextX -= 1;         nextMove = 'L';       }       else {         nextX += 1;         nextMove = 'R';       }     }     else {       // go up/down       if (rand() % 2 == 0) {         nextY -= 1;         nextMove = 'U';       }       else {         nextY += 1;         nextMove = 'D';       }     }     if (nextX < 0 || nextX > w+1 || maze[nextY][nextX] == 'X') {       // illegal move; give up and try another.       continue;     }     moves.push_back(nextMove);     curY = nextY;     curX = nextX;   }     return moves; }   /* Reads in a maze into a double array of chars. */ vector< vector > readMaze(istream& in) {   // YOU DON'T NEED TO CHANGE THIS FUNCTION.   int width = 0;   string line;   vector rows;   while (getline(cin, line)) {     if (line.find_first_not_of(" XO") != string::npos) {       cerr << "Invalid maze characters in row: " << line << endl;       exit(2);     }     line.erase(line.find_last_not_of(" \n\r\t")+1);     rows.push_back(line);     if (line.length() > width) width = line.length();   }   int height = rows.size();   assert (height >= 2);   assert (width >= 2);   vector< vector > maze(height);   for (int i=0; i& moves) {   for (int i=0; i > maze = readMaze(cin);   vector moves = calcMoves(maze);   writeMoves(moves);   return 0; }```