I'm sorry for making that much posts on my first day after signing up, but I have been testing several other Nim implementations and I thought this would also be interesting. I made a similar post today on <https://forum.nim-lang.org/t/7709#48912>
I encountered the following program: <https://rosettacode.org/wiki/N-queens_problem#Nim> , which basically tries to solve the N-queens problem. If I choose a too high N value, my RAM gets filled up really quickly. On my machine (8GB RAM) using GC the maximum N I can use is 14 or 15, less if not using a GC. I don't understand why this happens. I thought it would be related to lines 18-20, but I'm not sure. Does anyone know what happens?
