knights-travails

##My attempt to solve the knights travails problem

Thinking out loud

• At any point, the maximum number of unique moves that can be made by a knight is 8

• Moving back to the same spot while going on a path is useless

• Data structure: A directed unweighted graph that holds all the possible moves at a certain position

• Data Structure: Undirected unweighted graph that holds all possible moves throughout the board

• The graph is used to construct a predecessor map to reconstruct a path between any 2 squares

• The shortest path is traced using a modified Breadth first algorithm (modifed as in traces the path not only searching")

• A knight's possible moves at any position all follow the same pattern

UI Design

Mockups

• UI Mockup

• Wireframes

Color palette

#131124

#e90064

#b4aee8

#9ce1ff