Hi!
On Thu, Jun 17, 2010 at 10:04:58PM +0800, Fuming Wang wrote:
> > Do all the games have to start synchonously?
> >
> >
> Games are started one clock at a time.
I'm sorry, I don't quite understand that - does that mean that
different games can start at different times?
> I do not quite understand your description. I'm guessing that you mean to
> have n playouts at a time instead of one playout at a time like the regular
> UCT algorithm. Nonetheless, FPGA based method are very static in structure,
> and can not adapt easily to the dynamic changes of a game tree like a
> software implemented tree structure. So I don't know how to implement UCT
> type dynamic tree search algorithms in FPGA right now.
I haven't meant the tree search to be done on the FPGA at all, I have
merely tried to draft a method to effeciently queue games to be played
on the FPGA next. Are you planning to do the alpha-beta search in the
FPGA?
--
Petr "Pasky" Baudis
The true meaning of life is to plant a tree under whose shade
you will never sit.
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
