python project -- 3

PART A: Create a user-defined function named 'loadMaze' that accepts 3 parameters: 1. the maze string returned from the 'createMaze' function (above), 2. the # of rows the maze contains, and 3. the # of columns the maze contains. This function uses the maze string to create a 2-dimensional list containing every character in the maze. The first character stored at (0,0) and the last at (rows-1, cols-1). This function returns the 2-dimensional list. PART B: Your assignment also contains a user-defined function named 'solveMaze' that accepts the 2-dimensional list returned from the 'loadMaze' function as its only parameter. This function searches through the maze starting at coordinates (1, 0) (the '@' chatracter) until it finds the '#' symbol. The '@' symbol will ALWAYS be at coordinates (1, 0) regardless of maze size and there will ALWAYS be a '#' within the maze. Traversing through the maze can be accomplished by moving entirely in 2 directions only: right (East) and down (South). Once the '#' symbol is located, this function displays the following information: 1. A top row consisting of labels for each column of the maze (excluding the left and right border walls) and made up of the digits 0 to 9 and A to Z (see examples above). 2. A column on the left side with labels for each row in the maze (excluding the top and bottom border walls) made up of the digits 0 to 9 and A to Z (see examples above). 3. The entire 2-dimensional list contains the maze itself including the path from the '@' to the '#' consisting of 'E' and 'S' characters. 4. Below the maze, the following information: a) maze dimensions: rows x columns b) found # at coords: r,c c) path: EEEEEEEEEEEEESSSSEESSSSEESS d) total searches: x/y [login to view URL]% of maze where, a) is the number of rows and columns in the maze, b) represents the coordinate the '#' was located c) is the path (in characters) from '@' to the '#', and d) the total number of searches made through the maze where x is the total locations searched, y is the total number of valid locations eligible to be searched, and [login to view URL] is a 4 digit percentage of x / y. NOTE: The maze generating algorithm was designed to allow traversals in 2 directions only without the need to move up or to the left (more detail in the algorithm section below) and without the need for using recursion. The '#' symbol will always be accessible and there will only ever be 1 exact path that leads to it starting from the '@' symbol. Traversals through the maze may only be made along blank spaces and moving to a non-blank character such as '|', '+', '-', or '@' is NOT permitted.