The basic Monte Carlo tree search collects enough information to find the most promising moves only after many rounds; until then its moves are essentially random.
Heuristics used in Monte Carlo tree search often require many parameters.