Finding Safe Recursion Limit

I am working on a project where I am constructing a Monte Carlo search tree recursively. However, a few searches through the tree quickly causes me to reach max recursion depth. I know that you can set the limit to be higher, but I am unsure of the bounds to which I can before I jeopardize my computer memory (or if there even is a risk this will happen before my OS takes control). It doesn’t help that the answer is probably hardware dependent, but does anyone have suggestions for how to approach this problem (ie experimenting/stress testing)?