[computer-go] Is MC-UCT really scalable ... is a troll

[Christoph Birk]

On Tue, 22 Jan 2008, ivan dubois wrote:
> in theory, infinitely scalable. For example, the folowing algorithm is 
> infinitely scalable :
>     Analyse the complete mini-max tree of the game. If enough time to 
> finish, returns the correct move, if not, return a random move.
> Now, is this algorithm really scalable, in practive ? Of course not.

I have to disagree. The above algorithm is not scalable in a sense
that more time leads to better moves. Ie. It returns a random move
given 1 minute, 1 hour or 1 day of (current) CPU time, while a
scalable algorithm should return a better move the longer it runs.

Christoph