[computer-go] Efficiently selecting a point to play in a random playout

[Peter Drake]

This sounds a lot like the "roulette wheel" selection scheme used in  
genetic algorithms. The idea is that each candidate has a different  
slice of a roulette wheel, with better candidates getting bigger slices.

Peter Drake
http://www.lclark.edu/~drake/



On Jun 6, 2007, at 2:07 AM, Jacques Basaldúa wrote:

> I created something I call a ticket based lottery. Moves (legal in
> my case) "buy" tickets. An average move buys, say 10 tickets,
> the worst possible move buys just 1 and the most urgent buys
> 100. Of course these numbers should be tested empirically,
> because, the higher, the slower. (About 20 clockcycles per
> ticket. ~6ns·n is the difference between allocating 1 and allocating
> n (5 asm instructions)).
>
> And tickets are allocated in something similar to Don's idea.
>
> I have also considered doing multiple tickets just like coins.
> Having tickets of x1 and a separate tickets of x5 or some
> other value.
>
> Any ideas ?
>
> Jacques.
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20070606/1de4ebd7/attachment.htm