Use an iterative process (spiral or prototype SDLC) to design and implement a solution to your program. That means
1. write a small program to do a little bit of the problem
a. compile and run the small program
2. next, add a function or two
a. compile and run the improved program
3. repeat step 2 until you are finished
In this Manhattan tourist problem, the source is the first element of the matrix and the destination is the last element. The tourist can only move either right or down and only one at a time. For each move there is a number on the element which is the number of the visitations done by the tourist for that element. By the time the tourist reaches the destination, it has to make the maximum number of visits. The number of visits done by the tourist is saved to a file “Scores.txt” and is written and read at the end and the start of the program respectively.
EnterName – User must enter a valid name which will be stored along with the score in the Scores.txt file.
Make a move – User is only allowed to enter 1,2,3 to make a right move, down move or quit the game respectively. Any other input than this is a wrong choice and no action is taken for it.
Game over – When the user either selects the program to exit or when the user reaches the destination the game is over and the final score is displayed to the user.