When designing a completely new algorithm, a very thorough analysis of its correctness and efficiency is needed.
The last thing you would want is your solution not being adequate for a problem it was designed to solve in the first place.
In this article we will be talking about
Dynamic Programming is typically used to optimize recursive algorithms, as they tend to scale exponentially. The main idea is to break down complex problems (with many recursive calls) into smaller subproblems and then save them into memory so that we don't have to recalculate them each time we use
Artificial intelligence in its core strives to solve problems of enormous combinatorial complexity. Over the years, these problems were boiled down to search problems.
A path search problem is a computational problem where you have to find a path from point A to point B. In our case, we'll
