search for: 10x9

Hi all, I am playing around with latin squares, and wrote a recursive function that searches for valid combinations. Apart from the fact that there are very many, I run into troubles beginning with size 10x10 because the recursion depth becomes too large (max of 10x9-1=89 in this case). Why is this a problem? Isn't there enough space allocated to the stack? Can this be increased? The memory demand shouldn't be terrible, with only minimal local variables (only set and the function params r,c,t - s is local to a block called only once when a solution...