A backtracking algorithm begins in a predefined starting state and then moves from state to state in search of a desired ending state. At any point along the way, when there is a choice between several alternative states, the algorithm picks one, possibly at random, and continues. If the algorithm reaches a state that represents an undesirable outcome, it backs up to the last point at which there was an unexplored alternative and tries it. In this way, the algorithm either exhaustively searches all states, or it reaches the desired ending state. Assume you have a maze represented as 2d list, such as in attachment. Write an algorithm that calculates a path from P to T.

***I was given this problem for Python 3 in PyCharm Community Edition and I think it is called the Knight's Tour algorithm