title: Sliding Puzzle Solver using Manhattan Distance heuristic
body: <p>My friend and I have created a <a href="http://www.uploadmb.com/dw.php?id=1360672499" rel="nofollow">sliding puzzle program</a>. And then we have written a method for Manhattan distance and show MD result after every move. We first thought that the best tile for next move is the one with the least MD result. And the problem is that we sometimes get same Manhattan distance in at least two directions.(left, right, up, down). So we think we need other conditions and algorithm to choose the best move. So please advise us which requirements are needed and what is wrong with the program.</p>