   About A* and IDA* path finding algorithm
  I have read about A* algorithm and i understand how it is done. Im also reading about the A* algorithm optimized by Iterative Deepening A.K.A. "IDA*". I would like to optimize my A* into IDA* but i don't where to start. Can u help me here?Pseudocode for A*: Here is a pseudocode i have found for IDA:function IDA*(initial, Expand, Goal,Cost, Heuristic)limit   Heuristic(initial)loopdo result, limit   Contour (initial, limit)if result then return resultif limit = 1 then return failurefunction Contour(current, limit)cost   Cost(current) + Heuristic(current)if limit < cost then return null, costif Goal(current) then return solution, costnew-limit   1for each next in Expand(current)do result, cost   Contour(next, limit)if result then return solution, costnew-limit   min(new-limit, cost)return failure, new-limitNote: If u need the source code of my A*. Ill post it here   