DFID (Dept-First Iterative Deeping) vs. IDA* (Iterative-Deeping A*)

Question

I wonder what are the advantages and disadvantages of these two algorithms. I want to write AddEmUp C++ solved, but I'm not sure which (IDA or DFID) algorithm should I use.

The best article I found is this one, but it seems too old - '93. Any newer?

I think IDA* would be better, but.. ? Any other ideas?

Any ideas and info would be helpful.

Thanks! (:

EDIT: Some good articles about IDA* and a good explanation of the algorithm?

EDIT2: Or some good heuristic function for that game? I have no idea how to think of some :/

Answer 1

DFID is just a special case of IDA* where the heuristic function is the constant 0; in other words, it has no provision for introducing heuristics. If the problem is not small enough that it can be solved without using heuristics, it seems you have no choice but to use IDA* (or some other member of the A* family). That said, IDA* is really not that hard: the implementation provided by the authors of AIMA is only about half a page of Lisp code.

You can refer to the following links for getting more information about IDA:

• https://algorithmsinsight.wordpress.com/graph-theory-2/ida-star-algorithm-in-general/

• https://people.cs.pitt.edu/~milos/courses/cs1571/Lectures/Class7.pdf

• http://intelligence.worldofcomputing.net/ai-search/iterative-deepening-a-star.html#.XSWkDJMzbIU

If you want to make your career in Artificial Intelligence then go through this video: