Grow a search tree one rollout at a time: pick children by UCB1 (a good mean plus a bonus for being tried less), finish at random, score the result and pass it back up. The move is the child visited most.
This interactive visualization needs JavaScript.