I often like doing variations of math puzzles and riddles. For this one though, it's extremely hard for me to find a simulation runner to solve this variation, and this variation also is a lot tougher.
Here's a quick refresher of the original problem, as described in 3blue1brown's YouTube video "The most unexpected answer to a counting puzzle".
The problem includes two sliding blocks and a wall, the second block is coming at the other block at some velocity, while the second one starts out stationary. This is a overly idealistic problem where the floor is friction-less and all collisions are perfectly elastic. When the second block has a mass of a power of 100 in kilograms and the second block is 1 kg, a neat fact popped out that the total number of collisions has digits of $\pi$. (ex. if the second block is 100kg the number of collisions is 31)
My variation is that instead of 2 blocks, there are 3 blocks, each heavier than the other. When I tried doing this with a program that let's you run lots of physics simulations, having each block having a power of 100, it just, broke. So then I had a hypothesis, if the resulting number of collisions for the original puzzle had digits of $\pi$ (pi) , then the second one should have the digits of $\tau$ (tau, aka $2\pi$)
I hope one of you guys reading this post can help me find out the number of collisions, thanks.