On Wed, Feb 07, 2007 at 02:41:22PM -0600, Nick Apperson wrote:
> If it only did one playout you would be right, but imagine the following
> cases:
>
> case 1: White wins by .5 x 100, Black wins by .5 x 100
> case 2: White wins by 100.5 x 91, Black wins by .5 x 109
>
> the method that takes into a
On 7-feb-07, at 02:20, Dmitry Kamenetsky wrote:
I have been reading this list for nearly a year now and it is very
discouraging to receive so much criticism for my first post.
Don't be discouraged please. The big-mouths don't always represent
what the majority thinks.
The yahoo groups
On Sun, 2007-02-11 at 10:59 -0200, Mark Boon wrote:
> Don't be discouraged please. The big-mouths don't always represent
> what the majority thinks.
The opinions expressed for not wanting to move to a forum were polite
and thoughtful. Calling them "big-mouths" is uncalled for. It's also
quite
On 2/11/07, Jeff Nowakowski <[EMAIL PROTECTED]> wrote:
On Sun, 2007-02-11 at 10:59 -0200, Mark Boon wrote:
> Don't be discouraged please. The big-mouths don't always represent
> what the majority thinks.
The opinions expressed for not wanting to move to a forum were polite
and thoughtful. Call
Dmitry Kamenetsky wrote:
I have been reading this list for nearly a year now and it is very discouraging
to receive so much criticism for my first post.
Sadly, you chose a topic that is close to the hearts of many. I like
the style of this follow up post much more than the original in th
Please do.
I will put it on a web page. But I need some time. My job keeps me very
busy right now.
But I'm not sure I
will post the statistical analysis (it was almost ten hand writen pages,
and I'm not sure I still have them).
Have You performed an empirical test for collisions?
No, analysis
One way to provide instrumentation for collision detections is
to either reserve a few bits for the purpose, or allocate a
few extra bits for this purpose.
For instance, if you have a 64 bit key, use 60 bits instead
and let 4 bits be for collision detection. If the 60 bits match,
but the 4 bi
Peter Drake wrote:
out.writeObject(root);
Storing the root node of the Monte Carlo search will get storeObject()
called on all the siblings and children (assuming you are using an
implementation similar to the one on http://senseis.xmp.net/?UCT.
With 10.000 nodes, the depth of the tree is a
Alain's point, that knowledge can both help narrow the search to "good"
moves and at the same time steer you away from the best move is
absolutely true in SlugGo's case.
I completely agree with that.
However can we agree that we want a better player in a whole, and not
only better in some particu
On 2/10/07, Łukasz Lew <[EMAIL PROTECTED]> wrote:
On 2/10/07, Antoine de Maricourt <[EMAIL PROTECTED]> wrote:
> If there is strong interest, I can post the scheme.
Please do.
Since Antoine claims there is only on solution I might as well post
mine ;-)
mirroring: [abcdefgh] -> [hgfedcba]
ro
For those doing a lot of bit logic in their computer go programs, you might be
interested in this collection of highly optimized methods for doing things with
"bits"
(like counting bits sets in parallel and computing the minmum or maximin of two
integers without branching):
http://graphics.sta
11 matches
Mail list logo
