Here are two matches dates that I hold with love in my heart:
The current sum is 1970 + 1997 = 3967.
You must requisition at most 10 matches so that the sum is "as big as possible". We will call this sum $S$. You can remove in both figures with your own distribution as long as the number of matches isn't greater than 10. You must also ensure that all final digits are the same size. e.g. you can not have figure 1 with only one match, it must contains 2 matches.
With the matches that you get, you must create a Multiplier $M$ that also have the same digits size. The final aim of the puzzle is to maximize M times S.
Suppose that I remove the one from 1970 and a nine from 1997. I requisitioned 8 matches and get $S = 970+197=1167$ Suppose that I make the number 10 with my 8 matches. My final score will be $10S =11670$ which can easily be improved :D
Happy puzzling and optimizing!
lateral-thinking tag on!! However, cutting matches are not allowed.
My non lateral-thinking best is
My lateral thinking best is