Solves a coin change problem (a minimal set of coins adding up to a given amount) with the generic A* search algorithm in mrpt::graphs::CAStarAlgorithm.

Demo for the A* generic solver:

Example console output:

Input an integer number to solve a problem, or "e" to end.
761
An optimal solution has been found:
	2 coins of 2 piastres.
	0 coins of 7 piastres.
	2 coins of 8 piastres.
	39 coins of 19 piastres.