BestPathAstar_Strawberry_Prolog

Calculate the best path in a matrix with obstacles.

Example

---------------------------------------------------------------------------
from cell(3,9) To cell(8,7) in 13 Moves. 
[cell(3,9),cell(3,8),cell(3,7),cell(4,7),cell(4,6),cell(4,5),cell(4,4),cell(5,4),cell(6,4),cell(6,5),cell(6,6),cell(7,6),cell(8,6),cell(8,7)]
---------------------------------------------------------------------------

_ _ . . _ _ _ _ _ . . . . . 1
_ _ . . _ _ _ _ _ . _ . . . 2
_ _ _ _ _ _ * * * . _ . . . 3
_ _ . * * * * _ _ . _ . . . 4
_ _ _ * X X X _ _ _ _ _ _ _ 5
_ _ X * * * X _ _ _ X _ _ _ 6
_ _ X X _ * X X X X _ _ _ _ 7
_ _ _ _ _ * * _ X _ X . . . 8
_ _ . . _ _ _ _ _ . . . . . 9
X _ _ _ _ . . . _ _ _ . . . 10
_ _ _ _ _ . . . _ _ _ . . . 11
Yes.