title: Minimum number of steps to sort 3x3 matrix in a specific way
body: <p>So I started practicing some algorithms and programming before university starts and I ran into this problem:</p>
  
  <p>Given a 3x3 matrix containing the numbers from 0 to 8, find the minimum number of steps required to sort the matrix in the following format:</p>
  
  <p>1 2 3<br>
  4 5 6<br>
  7 8 0 </p>
  
  <p>In one move it is only allowed to pick a cell that is adjacent to the cell which contains the 0 and swap those two cells.</p>
  
  <p>Now, I am really stuck with this one and have no idea how to begin. Any tips and ideas to get me started are appreciated.</p>
  
  <p>This is not homework if anyone thinks that way, I am just trying to exercise and by moving to tougher problems I got stuck. I am not looking for anyone to write the code for me, I just need a point in the right direction because I really want to understand the algorithm behind this. Thank you.</p>