dlaurent42/npuzzle

[Algo] Implement A* Manhattan distance

Closed this issue · 1 comments

dlaurent42 commented
[Algo] Implement A* Manhattan distance
dlaurent42 commented

For each possible swap (without considering previous swap), sum distance of each "taquin" to its final position. Swap where the sum is the smallest. If sum equal 0 then, game is over.