Some info is missing.
The proposed list looks very sorted. Is that always the case ?
In case it is, you have a lot more chances to find a simple algorithm.
You might take the group average of the list , that is 9....
Now you start from the left and place the stick when the sum reaches that +/- number.
In this case it might be a coincidence. Do you have a larger example?
Paul
Edit:
I have to refine the previous somewhat: (created a random list with 50+ items, 20 sticks)
I concocted some heuristic that uses the average and the standard deviation.
You start from the left adding items until the sum + sdev > average.
Then you place a stick etc. This is a recursive function, because if you have
sticks left over, deduct 1 from the average and start again.
The tests i ran found a solution within 2 iterations.
To say that this is an algorithm will require some solid proof. :-)
The proposed list looks very sorted. Is that always the case ?
In case it is, you have a lot more chances to find a simple algorithm.
You might take the group average of the list , that is 9....
Now you start from the left and place the stick when the sum reaches that +/- number.
In this case it might be a coincidence. Do you have a larger example?
Paul
Edit:
I have to refine the previous somewhat: (created a random list with 50+ items, 20 sticks)
I concocted some heuristic that uses the average and the standard deviation.
You start from the left adding items until the sum + sdev > average.
Then you place a stick etc. This is a recursive function, because if you have
sticks left over, deduct 1 from the average and start again.
The tests i ran found a solution within 2 iterations.
To say that this is an algorithm will require some solid proof. :-)
It is more important to do the right thing, than to do the thing right.(P.Drucker)
Better is the enemy of good. (Montesquieu) = French version for 'kiss'.
Better is the enemy of good. (Montesquieu) = French version for 'kiss'.