This Program solves problems by searching for a combination of actions which eventually might lead to a solution. It can use multiple search algorithms including A* and RBFS. Benchmarking tests are included for two sample problems:

• Traveling in Romania to Bucharest [minimum cost path] and
• Finding exchange options for a given ammount of money using only a restricted set of coins [using as few coins as possible]