Page 1 of 1

2:54 Expert Q&A Traverse a maze recursively. Your program MUST read from a file called "maze.dat". A sample (Links to an

Posted: Tue Jul 12, 2022 8:11 am
by answerhappygod
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 1
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 1 (41.35 KiB) Viewed 26 times
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 2
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 2 (41.35 KiB) Viewed 26 times
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 3
2 54 Expert Q A Traverse A Maze Recursively Your Program Must Read From A File Called Maze Dat A Sample Links To An 3 (44.35 KiB) Viewed 26 times
2:54 Expert Q&A Traverse a maze recursively. Your program MUST read from a file called "maze.dat". A sample (Links to an external site.)maze has been provided. The actual maze will be larger. The start and end of the maze are represented with the characters + and -, respectively. The first line of the maze file will be the number of rows and columns, respectively. As your program moves through the maze the current path should also be marked with the + character. Any path leading to a dead end should be marked with the character. LTE Upon reaching the end of the maze your program should print a message to the screen stating that the maze was solved. If your program does not find the exit this should also be stated. All messages, and a print out of the solution, if one is found, should be to the screen. Here is the actual maze (Links to an external site.)file that will be used to test your programs. Done 41 41 хххххххххххх + X X X X х х ххххх ххх х х ххххх ххххххх х х ХХХ Х X X X X X X X X X X х ххххххххх ххххххххх ххххх ххххх ххх х X X X X X X X X X X X Xxx xx xxxXxx x x x XXX X XXX XXX XXXX X X X X х х х х х х х X X X х ххх ххххх х ххххххххххх ххх х ххххххххх X X X x X X x X X X х х х х х ххххх х х х ххххххх ххх х ХХХ Х XX X X X X х х X X х х х х х ххххх х х х ххххххххх Х Х ХХХ Х ХХХХХ Х X х х х X X X X X х ххх ххххх ххх ххххххххх х ххххххх ххххх X X X X X X X X X х х ххх ххх х ххххх х ххххххххх х ххххх х X X X х х X X X х х
2:54 Ringer Upon reaching the end of the maze your program should print a message to the screen stating that the maze was solved. If your program does not find the exit this should also be stated. All messages, and a print out of the solution, if one is found, should be to the screen. Here is the actual maze (Links to an external site.)file that will be used to test your programs. 41 41 ххххххх хххххх Х + х х х х ххххх ххх х х ххххх ххххххх х х ххх х X X х х х х х х х X х ххххххххх ххххххххх ххххх ххххх ххх х х Х X X X х х XX X X ххх х х ххххх х х х ххх Х ХХХ ХХХ Х ХХХ Х х Xxx х х х х х х х X X X х ххххххххх х ххх ххххх х ххххххххххх ххх х х х х х х Х X X X х х х х х ххххх х х х ххххххх ххх х ХХХ Х х х х х х х X X X X X X X X х ххххх х х х ххххххххх Х Х ХХХ Х ХХХХХ Х Х Х Х Х х X Х Х Х Х х ххх ххххх ххх ххххххххх х ххххххх ххххх X Х х X х х х X Х х х ххх ххх х ххххх х ххххххххх х ххХХХ Х X X X X X X X X X X ххххххххххх х ххххххххххх х X х Х X X X Х х х XX Х Х ХХХ Х Х ХХХХХ Х Х Х Х ХХХ Х ХХХ Х ХХХ х х Х Х Х Х Х Х Х Х Х Х Х Х Х х х ХХХ Х Х ХХХХХ Х X х х X X х х х х х х х ххх х ххххх Х ХХХ Х ХХХХххх ххххх х ХХХХХ х ххх х х ххххх ххх х X X х х х х х ххххххххххххххх ххххххххххх ххххх х х ххх ххххххх х х ххх х х х X X х x х х ххххх х х х х ххх х х ххххх ххххххххх X X X X X X X X X x Х ххххххх ххххх х ххх х ххххххххххх ххх х X Х Х Х Х Х х х X х х х х х х х х х х ххх х ххххххх ххх хх хх ххх х х х х х х х х х х х х х х х х х ххххххххх х ххххх х ХХХ Х Х Х ХХХ х х х х х х х ххх ххххххххххх х х х х х х х х х х ххххххххххххх х х х х Х Х Х LTE X X х х х х х ххххххх хХХ Х Х Х Х Х Х Х ХХХХХ ххххх х X X X X X X X ххххххххх XXXXXX Done