A* algorithm for C-lisp project

The A* algorithm to solve the problem; create at least 2 heuristic functions, the Manhattan distance and another one (proposed/chosen by the person).