Choosing the alternate algorithm is probably the best plan, but for what it's worth, if you did want to use multiprocessing, you'd probably have a different problem to solve. For example, let's say you had a list of lists of numbers.
nums = [[1,2,3],[7,8,9],[4,5,6]]
Then you could have a function per-sub-list that maybe calculates and returns the sum of the numbers in the sub-set. Aggregate the results to get the full sum, probably more quickly than you would otherwise with a large enough data set. You could have a multiprogramming merge sort too, for example. Multiprogramming/threading is best when you have a number of tasks that don't interfere with each other and can be completed in isolation.
For your original problem, you'd probably have to think about how to keep track of total rolls per side so you could have a function per side calculating rolls, but then there would be the usual issue of figuring how to make sure counters are consistent / how to know when to stop.