Ok, this is a "special" minimax solver. Call it the "Ivan Dubois stupid minimax
solver" if you like.
Anyway, its only purpose is to show that :
"Returns the best move when given enough time" does NOT implie "Is scalable
in practice".
I am very sad that this simple logic has no appeal to most people on this list.
----- Message d'origine ----
De : Erik van der Werf <[EMAIL PROTECTED]>
À : computer-go <computer-go@computer-go.org>
Envoyé le : Mercredi, 23 Janvier 2008, 15h21mn 37s
Objet : Re: Re : [computer-go] Is MC-UCT really scalable ... is a troll
On Jan 23, 2008 2:45 PM, ivan dubois <[EMAIL PROTECTED]> wrote:
> When I say a minimax solver, I mean a program witch returns a random move
> UNTIL it has completed its search, as I explained in a previous post.
A plain minimax solver (without enhancements like iterative deepening)
doesn't return anything until it has completed its search.
E.
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_____________________________________________________________________________
Ne gardez plus qu'une seule adresse mail ! Copiez vos mails vers Yahoo! Mail
http://mail.yahoo.fr
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
