I have a numpy 2d Matrix that look like this :
[
['' '' '' '' '' '' '' '' '' '']
['' '' '' '' '' '' '' 'c' '' '']
['' '' '' '' '' '' '' '' '' '']
['' '' '' '' '' '' '' '' '' '']
['' '' 't' '' '' '' '' '' '' '']
['' '' '' '' '' '' '' 'c' '' '']
['' '' '' '' '' '' '' '' '' '']
['' '' '' '' '' '' '' 'm' '' '']
['' '' '' '' '' '' '' '' '' '']
['' '' '' '' '' '' '' '' '' '']
]
Source : 't'
destination : 'm'
But the move-set of the 't' emulates the moves of a knight from the game of Chess.
Blue is 't' and pink points are it's next moves. How can i apply Breadth first search or Depth First search to find next best move for 't' toward 'm'
