A* search algorithm: Difference between revisions

</pre>

 

 

<lang python>from __future__ import print_function

#Define a class board like grid with two barriers

self.barriers.append([(2,4),(2,5),(2,6),(3,6),(4,6),(5,6),(5,5),(5,4),(5,3),(5,2),(4,2),(3,2)])

#adjacent or diagonal

D2 = 1

dy = abs(start[1] - goal[1])

return D * (dx + dy) + (D2 - 2 * D) * min(dx, dy)

<pre>route [(0, 0), (1, 1), (2, 2), (3, 1), (4, 1), (5, 1), (6, 2), (7, 3), (6, 4), (7, 5), (6, 6), (7, 7)]

cost 11</pre>

 

=={{header|Racket}}==