Somewhat... One could generate a random number (r) and combine it with
the move mask (m) as follows:
black moves = m & r
white moves = m & ~r
This has the drawback that the number of black and white moves may not
be equal. It can be modified to give an equal number of moves such as
requiring that each subset of n intersections generates the same
number of black and white moves, or doing some kind of looping until
the condition is met.
For looping, you could keep some subset of the generated moves in
order to guarantee convergence. For example, if there are 14 more
white moves than black moves, keep all generated moves except for 14
white moves. Then you only have to pick 14 moves in the next loop
iteration.
Sent from my iPhone
On Sep 10, 2009, at 8:43 AM, Petr Baudis <pa...@ucw.cz> wrote:
On Thu, Sep 10, 2009 at 08:29:31AM -0400, Jason House wrote:
I've thought of something similar in the past, but with a twist:
pre-compute a subset of moves that could be safely played in
parallel. Even if you can only play 285 moves in parallel on an
empty 19x19, it could still be a huge speed boost.
Hmm, do you have some ideas how this pre-computation could be done in
less than O(N)?
I'm gonna think about this now during some travelling... ;-)
Petr "Pasky" Baudis
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
