Jump to content

A* search algorithm: Difference between revisions

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.
<lang Picat>% An A*-like algorithm is used in tabling
% See the program for the 15-puzzle at https://rosettacode.org/wiki/Category:Picat
%
main =>
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.