[computer-go] 10k UCT bots

Don Dailey drdailey at cox.net
Tue May 13 13:10:51 PDT 2008



Mark Boon wrote:
>
> On 13-mei-08, at 16:17, Don Dailey wrote:
>
>> I missed this from you.   I assumed that you did this anyway.   If 
>> you choose a random point and then traverse linearly to the end,  
>> what do you do when you reach the end?     Do you just pass?    I 
>> assumed you viewed the empty point list as a circular queue.
>
> No I didn't. When I  reach the end I traverse in the opposite 
> direction, starting from the originally chosen location. Using a 
> circular list may actually be simpler.
It's probably simpler.   You have to choose between using branching or 
division:

    nextLoc = curLoc % LIST_SIZE;

or

   if (nextLoc > MAX_ELEMENT) nextLoc = firstLoc;

- Don


>
> Mark
>
>
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/


More information about the computer-go mailing list