A* search algorithm: Difference between revisions
Content added Content deleted
| Line 3,731: | Line 3,731: | ||
=={{header|Picat}}== |
=={{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 => |
main => |
||