I have taken an interest in the monte Carlo tree search applied in games recently.

I have read several papers, but I use "Monte-Carlo Tree Search" A Ph.D. thesis by Chaslot, G as i find it more easy to understand the basics of Monte Carlo tree search

I have tried to code it and stuck on certain problems. The algorithm tries to expand one node into the game tree for every one simulation. This quickly escalates to memory problems. I have quickly read the paper, but it doesn't seem to explain what the technique will do if it hits a certain memory limit.

Can you suggest what should the technique do if it hits a certain memory limit?

you can see the paper here: __http://www.unimaas.nl/games/files/phd/Chaslot_thesis.pdf__