Hello,

I have to do this project using the AIMA SEARCH JAVA LIBRARIES FROM THE BOOK AI: MODERN APPROACH - STUART RUSSEL.
The problem consists that the user will have to enter n numbers and then n quantity to guess and the solution will be the different operations that the user will have to do to get to the target and you can only use once the numbers.

Example:

USER ENTERS: 10 5 20
USER ENTERS QUANTITY TO GUESS= 1000
SOLUTION WILL BE THE OPERATIONS TO DO TO GET TO 1000: 10*20= 200
200*5= 1000
END OF GAME


This I have to do it using any search algorithm from AIMA. My question is do you think a deeppening iterative search algorithm is ok to solve this?
Any help in how to begin this?. Thank you

THANK YOU