[computer-go] MC and tactics?

[Chrilly]

How does a MC "see" a forced tactical sequence?
Lets assume a simple 10 moves deep ladder. Even if the probability is 0.5 
for playing the correct move, the final probability is 0.001.
Does the MC player reley on the principle of mutual stupidity? That the 
defender does not play the correct defence-moves either? In case of 
learning/updating of the playing statistics, this would mean, that both side 
must have the same learning rule, otherwise one side learns to win sequences 
which are no win against correct defence and similarily to defend positions 
that are in fact lost.

The principle of mutual stupidity is also important for database statistics. 
E.g. the Hydra chess expert GM-Lutz analysed the wining/drawing statistics 
of certain endgames from the ChessBase MegeBase. In most cases the 
statistics are from a certain playing level on (about 2400 Elo) not anymore 
related to the Elo-rating. 2 Super-GMs have about the same chances than 2 
IMs playing each either. There can be no doubt, that the Super-GMs play the 
endgame better, but the higher error rate of the IMs compensates each other. 
It is also known that GMs have difficulties to mate God with the queen 
against a rook. But they win relative easily against another human of the 
same strength.

Chrilly

Note: A MC programm can of course augmented with a ladder-routine. But thats 
not the point of my question.