Can someone provide me with an algorithm or psuedo code or actual code for the DFID portion of a recursive solution for the 8-Puzzle? I''m a bit stuck right now. I''m currently relying upon a 2-dimensional array to hold the values from 0 - 8 where 0 serves as the blank section. My solution works with the notion of moves being taken relative to the directions that the blank tile (0) can legally move. Thanks