[computer-go] Pay-as-you-go cluster?

[Benjamin Teuber]

Chrilly wrote:

> One can refine this algorithm. When a processor starts to calculate a move, 
> the move is entered as "open" in the hashtable. The other processes do not 
> calculate an open move as long as they have something other to do (Only the 
> first move is calculated always).
> Maybe a similar idea can be used in UCT.

How about using a "tuned" pseudo-random generator that has different seeds for each computer in a way the possibility to chose different moves is maximized. Of course, UCT should become indeterministic to do that.

Ben
_______________________________________________________________________
Viren-Scan für Ihren PC! Jetzt für jeden. Sofort, online und kostenlos.
Gleich testen! http://www.pc-sicherheit.web.de/freescan/?mc=022222