Given something like this:1 5 3 4 = 18I need to determine (using an algorithm) if there is a combination of operators and brackets that bring me to 18. Only + and * and ( and ) are allowed.Example:1 + 5 + ( 3 * 4 ) = 18Beside brute force, is there any particular algorithm that is able to compute all the possible combo in reasonable time? RPN may help in order to encode the possible solutions, but the same are a lot (4^n ?).
All possible solutions to equation, where operators are arbitrary?
algorithms;math