CU Knight Tour Algorithm Development & Data Structure Programming Exercise

Question Description

If you don’t want to create a video, please write down the instructions and explanations to Word, so I can refer to it. Thank you.

You must develop an algorithm and/or data structure and implement it to solve a problem of your choosing. For example, you may want to address the classic Knight’s Tour (Links to an external site.) problem by implementing a graph utilizing a depth first search algorithm. In your program, you must also provide a test case for the algorithm. This is a fairly open-ended challenge but should showcase the skills and knowledge you have acquired over your coursework so far.

You will be submitting your code as a .py file as well as a brief video of you explaining what your program should do and so it functioning. You may reference the rubric to further understand the parameters for grading.

CriteriaRatingsPts

This criterion is linked to a Learning OutcomeFunctionalityProgram completes its set purpose

30.0 pts

Full Marks

0.0 pts

No Marks

30.0 pts

This criterion is linked to a Learning OutcomeVideo WalkthroughClearly explains code and demonstrates its functionality

30.0 pts

Full Marks

15.0 pts

Half Marks

0.0 pts

No Marks

30.0 pts

This criterion is linked to a Learning OutcomeReadabilityCode is readable and clearly commented and organized.

10.0 pts

Full Marks

5.0 pts

Half Marks

0.0 pts

No Marks

10.0 pts

This criterion is linked to a Learning OutcomeProblem SetProblem choose for program to solve fits under the submission guidelines.

5.0 pts

Full Marks

0.0 pts

No Marks

5.0 pts

This criterion is linked to a Learning OutcomeData Structure ImplementationData Structures are clearly referenced and articulated what they are and how they will be utilized.

10.0 pts

Full Marks

5.0 pts

Partial

0.0 pts

No Marks

10.0 pts

Total Points: 85.0