CsCss | CSS parsing library for C # based on Mozilla Firefox code | Browser Plugin library

The problem statement is this:

An alien robot is threatening the universe, using a beam that will destroy all algorithms knowledge. We have to stop it!

Fortunately, we understand how the robot works. It starts off with a beam with a strength of 1, and it will run a program that is a series of instructions, which will be executed one at a time, in left to right order. Each instruction is of one of the following two types:

C (for "charge"): Double the beam's strength. S (for "shoot"): Shoot the beam, doing damage equal to the beam's current strength. For example, if the robot's program is SCCSSC, the robot will do the following when the program runs:

Shoot the beam, doing 1 damage. Charge the beam, doubling the beam's strength to 2. Charge the beam, doubling the beam's strength to 4. Shoot the beam, doing 4 damage. Shoot the beam, doing 4 damage. Charge the beam, increasing the beam's strength to 8. In that case, the program would do a total of 9 damage.

The universe's top algorithmists have developed a shield that can withstand a maximum total of D damage. But the robot's current program might do more damage than that when it runs.

The President of the Universe has volunteered to fly into space to hack the robot's program before the robot runs it. The only way the President can hack (without the robot noticing) is by swapping two adjacent instructions. For example, the President could hack the above program once by swapping the third and fourth instructions to make it SCSCSC. This would reduce the total damage to 7. Then, for example, the president could hack the program again to make it SCSSCC, reducing the damage to 5, and so on.

To prevent the robot from getting too suspicious, the President does not want to hack too many times. What is this smallest possible number of hacks which will ensure that the program does no more than D total damage, if it is possible to do so?

My code currently computes the smallest number of hacks after swapping every adjacent character in the string. However, this does not cover all the possibilities to create the smallest number of hacks N required to have damage <= damage that shield can withstand. What algorithm would be required to go through every possibility and find the smallest number of hacks required? My code is below for reference.