A* search algorithm: Difference between revisions

0)))

;; Check if this state was already looked at

;; Insert the next node into the queue

(heap-insert

(node :pos position :path (cons position (node-path node))

:cost cost :f-value f-value)

 

;; The actual A* search