title: Number of shortest paths
body: <p>Here is the problem:</p>
  
  <p>Given the input n = 4 x = 5, we must imagine a chessboard that is 4 squares across (x-axis) and 5 squares tall (y-axis). (This input changes, all the up to n = 200 x = 200)</p>
  
  <p>Then, we are asked to determine the minimum shortest path from the bottom left square on the board to the top right square on the board for the Knight (the Knight can move 2 spaces on one axis, then 1 space on the other axis).</p>
  
  <p>My current ideas:</p>
  
  <p>Use a 2d array to store all the possible moves, perform breadth-first 
  search(BFS) on the 2d array to find the shortest path.</p>
  
  <p>Floyd-Warshall shortest path algorithm.</p>
  
  <p>Create an adjacency list and perform BFS on that (but I think this would be inefficient).</p>
  
  <p>To be honest though I don't really have a solid grasp on the logic.</p>
  
  <p>Can anyone help me with psuedocode, python code, or even just a logical walk-through of the problem?</p>