Recommendation on how to develop the program: a. Create a class named Map which would be used to create the following: - The actual Map of Mars, which is to be hidden from the user and will only be displayed to the user at the end of the game. The Mars Rover Mapper, which keeps track of the cells in the map the Rover had already observed. b. One possible minimal class declaration for Map is shown below: class Map { private: vector > map; int dimx, dime; public: Map(int dimx, int dimy); void resize (int dimx, int dimy, char ch); void display(); void setObject (int x, int y, char ch); char getObject (int x, int y); bool isEmpty(int x, int y); bool ishill (int x, int y); bool isTrap (int x, int y); bool isInsideMap (int x, int y); int getDimx(); int getDimy(); }; //Map c. Create a class named Rover, which would be used to keep track of the location and heading of the Rover. One possible minimal class declaration is shown below. class Rover private : int x,y; Direction heading; char object Under Rover; Map* p_mars; 1/a pointer to the map for Mars Map mapper; //a map that keeps track of observed cells so far public: Rover(); void land (Map& mars); //links a map of Mars to a Rover bool turn Left(); bool turn Right(); bool move(); void displayMapper(); bool executeCommand (char command); }; //Rover d. The class declarations above are only the bare minimal, you may want to add member functions and data member such as for keeping track of golds collected etc. e. The data type Direction can be defined using enumeration as shown below. Please refer to your textbook on how to use enum. enum Direction north = 0, east = 1, south = 2, west = 3 f. As the Rover moves across the map, it would be able to read the three cells just in front of it. g. There are hills on the map which prevent the Rover from moving to those cells. h. There are traps on the map, if the Rover moves to any of those cells, the mission is failed. i. You are free to design your scoring system and other type of cells, you may also introduce new challenges for the Rover. The GOAL of the game is for the Rover to collect all the golds on Mars. The Mars Rover assumed to be ALWAYS starts at the centre of the map which is ALWAYS an empty space, but the Rover's heading can start at any of the north, east, south or west direction You MUST design your map such that all the golds are reachable from the starting cell and that they can be collected by the Rover. The ALGORITHM TO GENERATE THE MAP would constitute AT LEAST ONE- THIRD OF THE TOTAL MARKS of the assignment, all the cells must be randomly generated with good schemes. FOCUS FIRST on designing the algorithm that generates the map. Use your creativity!! Yes, programming is also a CREATIVE PROCESS. For MAP GENERATION, you may want to make good use of the pseudo-random number generator from the C++ Standard Library. If we want to generate 100 characters with a 10% chance of getting X, 30% chance of getting Y' and 60% chance of getting Z', we can do that with a program such as the below: #include #include #include // for time() in srand( time(NULL)); using namespace std; int main() char charlist () = {'X', 'Y', 'Y', 'z', 'z', 'z', 'Z', 'z', 'Z'); 1/seed for pseudo-random number generator unsigned int seed = time (NULL); srand (seed); int countx = 0, county = 0, countz = 0; for (int i=0; idemo_rand ZZYYZZZYYZZZzyzzzzzzzzzxzYYZYZYZXZYzzzzzzzzzzzzzzz YZXZXYZZYZZYZYYZ ZY ZXZ ZZZYZYXXYZYZZzzzz ZXZYZZZZZZX Number of x = 9 Number of Y = 23 Number of Z - 68 C:\dev>demo_rand ZXZZXZZYZYYZYXZXZYYZZZYZYZXZZZXZZYYZZZYZYYZYZZZXYZ XYYYYZ YXZ Zzzzzzzzzzzzxzzz Zxzxzzzzz ZYXYYZYYYXXZ YYZZ Number of x = 14 Number of Y = 31 Number of z = 55 C:\dev>demo_rand ZZYZYYZYZ ZXYYxZZ ZZ ZXYYZZZZzxzzzxzZzzzzZZZZZXXYZYYZ ZYZYZYXYZZZZZYZXZYZYZYYZYZZXZZYYZZZYXZYYY ZXZ YZ YYZY Number of x = 12 Number of Y = 32 Number of z = 56 C:\dev>demorand YZYZYZXZZxzxzzzzzzzzzzzzzzxzzxzzxzyzZZZYZZZZYYZYZZ ZZYZZZXZZZYYZYYYYZZZZZYZYYYYZXYYYZYYZYXYYZYYZZZ Number of x = 9 Number of Y = 34 Number of Z = 57 A possible approach to generate the map is as follows: Step 1: Populate the cells in the map with objects (i.e. represented using characters) using a desired probability. Step 2: Change the cell at the centre of the map to be an empty space (since the Rover is always assumed to start at the centre). Step 3: Do a partially random walk in the map starting at the centre of the map, with a random heading direction. Step 4: Keep moving in the current direction and change the cells to be empty spaces as we move along that direction. Step 5: Generate a pseudo-random number, and based on that number, decide whether to turn left, turn right, or continue in the same direction. For example, in order to have a 20% chance of turning left, 20% chance of turning right, and 60% chance of moving ahead, you can generate a pseudo-random number in the range from 0 to 9 and turn left if the number tums out to be 0 or 1, turn right if the number turns out to be 8 or 9, and stay in the same direction otherwise. If you reach the boundary of the map, just tum around Step 6: As you move along the map, generate a pseudo-random number, and decide to put a gold object or not. For example, generate a pseudo-random number in the range from 0 to 9, if the number is 0, you change the object at the cell to be a gold object, this means there is a 10% chance of dropping a gold when you move along the map. Step 7: Repeat Step 4 onwards until you have dropped desired number of golds. Recommendation on how to develop the program: a. Create a class named Map which would be used to create the following: - The actual Map of Mars, which is to be hidden from the user and will only be displayed to the user at the end of the game. The Mars Rover Mapper, which keeps track of the cells in the map the Rover had already observed. b. One possible minimal class declaration for Map is shown below: class Map { private: vector > map; int dimx, dime; public: Map(int dimx, int dimy); void resize (int dimx, int dimy, char ch); void display(); void setObject (int x, int y, char ch); char getObject (int x, int y); bool isEmpty(int x, int y); bool ishill (int x, int y); bool isTrap (int x, int y); bool isInsideMap (int x, int y); int getDimx(); int getDimy(); }; //Map c. Create a class named Rover, which would be used to keep track of the location and heading of the Rover. One possible minimal class declaration is shown below. class Rover private : int x,y; Direction heading; char object Under Rover; Map* p_mars; 1/a pointer to the map for Mars Map mapper; //a map that keeps track of observed cells so far public: Rover(); void land (Map& mars); //links a map of Mars to a Rover bool turn Left(); bool turn Right(); bool move(); void displayMapper(); bool executeCommand (char command); }; //Rover d. The class declarations above are only the bare minimal, you may want to add member functions and data member such as for keeping track of golds collected etc. e. The data type Direction can be defined using enumeration as shown below. Please refer to your textbook on how to use enum. enum Direction north = 0, east = 1, south = 2, west = 3 f. As the Rover moves across the map, it would be able to read the three cells just in front of it. g. There are hills on the map which prevent the Rover from moving to those cells. h. There are traps on the map, if the Rover moves to any of those cells, the mission is failed. i. You are free to design your scoring system and other type of cells, you may also introduce new challenges for the Rover. The GOAL of the game is for the Rover to collect all the golds on Mars. The Mars Rover assumed to be ALWAYS starts at the centre of the map which is ALWAYS an empty space, but the Rover's heading can start at any of the north, east, south or west direction You MUST design your map such that all the golds are reachable from the starting cell and that they can be collected by the Rover. The ALGORITHM TO GENERATE THE MAP would constitute AT LEAST ONE- THIRD OF THE TOTAL MARKS of the assignment, all the cells must be randomly generated with good schemes. FOCUS FIRST on designing the algorithm that generates the map. Use your creativity!! Yes, programming is also a CREATIVE PROCESS. For MAP GENERATION, you may want to make good use of the pseudo-random number generator from the C++ Standard Library. If we want to generate 100 characters with a 10% chance of getting X, 30% chance of getting Y' and 60% chance of getting Z', we can do that with a program such as the below: #include #include #include // for time() in srand( time(NULL)); using namespace std; int main() char charlist () = {'X', 'Y', 'Y', 'z', 'z', 'z', 'Z', 'z', 'Z'); 1/seed for pseudo-random number generator unsigned int seed = time (NULL); srand (seed); int countx = 0, county = 0, countz = 0; for (int i=0; idemo_rand ZZYYZZZYYZZZzyzzzzzzzzzxzYYZYZYZXZYzzzzzzzzzzzzzzz YZXZXYZZYZZYZYYZ ZY ZXZ ZZZYZYXXYZYZZzzzz ZXZYZZZZZZX Number of x = 9 Number of Y = 23 Number of Z - 68 C:\dev>demo_rand ZXZZXZZYZYYZYXZXZYYZZZYZYZXZZZXZZYYZZZYZYYZYZZZXYZ XYYYYZ YXZ Zzzzzzzzzzzzxzzz Zxzxzzzzz ZYXYYZYYYXXZ YYZZ Number of x = 14 Number of Y = 31 Number of z = 55 C:\dev>demo_rand ZZYZYYZYZ ZXYYxZZ ZZ ZXYYZZZZzxzzzxzZzzzzZZZZZXXYZYYZ ZYZYZYXYZZZZZYZXZYZYZYYZYZZXZZYYZZZYXZYYY ZXZ YZ YYZY Number of x = 12 Number of Y = 32 Number of z = 56 C:\dev>demorand YZYZYZXZZxzxzzzzzzzzzzzzzzxzzxzzxzyzZZZYZZZZYYZYZZ ZZYZZZXZZZYYZYYYYZZZZZYZYYYYZXYYYZYYZYXYYZYYZZZ Number of x = 9 Number of Y = 34 Number of Z = 57 A possible approach to generate the map is as follows: Step 1: Populate the cells in the map with objects (i.e. represented using characters) using a desired probability. Step 2: Change the cell at the centre of the map to be an empty space (since the Rover is always assumed to start at the centre). Step 3: Do a partially random walk in the map starting at the centre of the map, with a random heading direction. Step 4: Keep moving in the current direction and change the cells to be empty spaces as we move along that direction. Step 5: Generate a pseudo-random number, and based on that number, decide whether to turn left, turn right, or continue in the same direction. For example, in order to have a 20% chance of turning left, 20% chance of turning right, and 60% chance of moving ahead, you can generate a pseudo-random number in the range from 0 to 9 and turn left if the number tums out to be 0 or 1, turn right if the number turns out to be 8 or 9, and stay in the same direction otherwise. If you reach the boundary of the map, just tum around Step 6: As you move along the map, generate a pseudo-random number, and decide to put a gold object or not. For example, generate a pseudo-random number in the range from 0 to 9, if the number is 0, you change the object at the cell to be a gold object, this means there is a 10% chance of dropping a gold when you move along the map. Step 7: Repeat Step 4 onwards until you have dropped desired number of golds