Manhattan Tourist Project
Budget: $2 – $8 USD
Instructions:
Turn in a complete C++ program that can be used to solve the Manhattan Tourist Problem using dynamic programming. You can work in a group. The maximum number of students that can be in a group is 2. Once you form a group you cannot change groups. Everyone in a group needs to submit all parts of the project before the due date.
1. Turn in your work via the Blackboard dropbox entitled “Manhattan Tourist Problem Assignment”.
2. Cheating will result in a grade of F in the course. Cheating includes using code that has been posted to websites such as but not limited to chegg or coursehero. Your instructor will be checking these websites for code similarity prior to grading your work.
C++ program requirements:
1. The program must output the following heading at the top of the console screen: (1 point)
“CS 3304 – Manhattan Tourist Problem”
“Your Name(s)”
2. The program must only input graph data from a .csv file. (4 points)
3. The program must be able to work with any 2D graph of any dimension. (10 points)
4. The program must solve this problem using a dynamic programming method. (10 points)
5. The program must output the Manhattan weights to the console screen. Show the weight of each edge. You don't need to draw the horizontal and vertical lines for the Manhattan grid. Your program also does not need to consider diagonal edge weights. The Console Output should look something like the following. Be sure to include: (1) CS 3304 and (2) your name(s) at the top of the program.
In the above figure, every non-zero value represents an edge weight. The above output corresponds to the following Manhattan grid:
6. The program must output the optimal path AND the optimal score to the console screen. (75 points).
Example:
Optimal Path = S, E, E, E, S, S,
Optimal Score = 25
Your program does not need to compute all optimal paths. If an eastern path and a southern path leads to a vertex having the same score, the program should take the southern path. This will make grading your work easier.
7. The program must be able to compile and run using Visual Studio 2019. Use the university lab computers to ensure that this requirement is met before turning it in.
8. Turn in a compressed .zip folder containing the entire project environment. Only submit a .zip or .zipx file. Do not turn in a file of type .7z or .rar. Make sure that all necessary .cpp files, .h files, and any other necessary sub-folders are included in the project. The following screenshot shows an example of what files need to be turned in. Do not turn in any shortcuts to files.
Turn in a complete C++ program that can be used to solve the Manhattan Tourist Problem using dynamic programming. You can work in a group. The maximum number of students that can be in a group is 2. Once you form a group you cannot change groups. Everyone in a group needs to submit all parts of the project before the due date.
1. Turn in your work via the Blackboard dropbox entitled “Manhattan Tourist Problem Assignment”.
2. Cheating will result in a grade of F in the course. Cheating includes using code that has been posted to websites such as but not limited to chegg or coursehero. Your instructor will be checking these websites for code similarity prior to grading your work.
C++ program requirements:
1. The program must output the following heading at the top of the console screen: (1 point)
“CS 3304 – Manhattan Tourist Problem”
“Your Name(s)”
2. The program must only input graph data from a .csv file. (4 points)
3. The program must be able to work with any 2D graph of any dimension. (10 points)
4. The program must solve this problem using a dynamic programming method. (10 points)
5. The program must output the Manhattan weights to the console screen. Show the weight of each edge. You don't need to draw the horizontal and vertical lines for the Manhattan grid. Your program also does not need to consider diagonal edge weights. The Console Output should look something like the following. Be sure to include: (1) CS 3304 and (2) your name(s) at the top of the program.
In the above figure, every non-zero value represents an edge weight. The above output corresponds to the following Manhattan grid:
6. The program must output the optimal path AND the optimal score to the console screen. (75 points).
Example:
Optimal Path = S, E, E, E, S, S,
Optimal Score = 25
Your program does not need to compute all optimal paths. If an eastern path and a southern path leads to a vertex having the same score, the program should take the southern path. This will make grading your work easier.
7. The program must be able to compile and run using Visual Studio 2019. Use the university lab computers to ensure that this requirement is met before turning it in.
8. Turn in a compressed .zip folder containing the entire project environment. Only submit a .zip or .zipx file. Do not turn in a file of type .7z or .rar. Make sure that all necessary .cpp files, .h files, and any other necessary sub-folders are included in the project. The following screenshot shows an example of what files need to be turned in. Do not turn in any shortcuts to files.