Anonymous user
A* search algorithm: Difference between revisions
→{{header|Picat}}
Line 3,731:
=={{header|Picat}}==
<lang Picat>% Picat's tabling system uses an algorithm like Dijkstra's to find an optimal solution. Picat's planner supports A* search with heuristics.
% See the program for the 15-puzzle at https://rosettacode.org/wiki/Category:Picat
%
main =>
| |||