Monte carlo chooses some possible moves at random, then evaluates which is most successful and has a bias towards the more successful ones.

This has the randomness but without any bias or evaluation of effectiveness.

But really, Monte Carlo in Go can basically be thought of as a lazy, intelligent brute-forcing method.