title: What can be the efficient approach to solve the 8 puzzle problem?
body: <p>The 8-puzzle is a square board with 9 positions, filled by 8 numbered tiles and one gap. At any point, a tile adjacent to the gap can be moved into the gap, creating a new gap position. In other words the gap can be swapped with an adjacent (horizontally and vertically) tile. The objective in the game is to begin with an arbitrary configuration of tiles, and move them so as to get the numbered tiles arranged in ascending order either running around the perimeter of the board or ordered from left to right, with 1 in the top left-hand position.         </p>
  
  <p><img src="https://www.8puzzle.com/images/8%5Fpuzzle%5Fstart%5Fstate%5Fa.png" alt="8 puzzle"></p>
  
  <p>I was wondering what approach will be efficient to solve this problem?</p>