Hi!
On Tue, Nov 17, 2015 at 07:05:34AM -0500, Álvaro Begué wrote:
> If anyone knows of a program that can actually use something like expected
> score in the UCT move selection formula, that's probably what I need. I
> might end up modifying Pachi to do this, but it sounds daunting.
That's
Is the last requirement equivalent to dynamic komi?
On Tue, Nov 17, 2015 at 9:49 AM, Darren Cook wrote:
> > I am trying to create a database of games to do some machine-learning
> > experiments. My requirements are:
> > * that all games be played by the same strong engine on
> I am trying to create a database of games to do some machine-learning
> experiments. My requirements are:
> * that all games be played by the same strong engine on both sides,
> * that all games be played to the bitter end (so everything on the board
> is alive at the end), and
> * that both
Thanks for your answer.
Unfortunately Pachi doesn't seem to really try to maximize score, even with
these settings: Once one side has won by a large enough margin, it will
stop trying to kill small groups and I am precisely trying to generate a
database to learn about life and death. Perhaps I
...@computer-go.org] On Behalf Of
Chun Sun
Sent: Tuesday, November 17, 2015 7:15 AM
To: computer-go@computer-go.org
Subject: Re: [Computer-go] Strong engine that maximizes score
taking my question back. the answer is no in the context of mcts.
On Tue, Nov 17, 2015 at 10:10 AM, Chun Sun <sun
After reading the relevant code, I realized that val_scale=1.0 should do
precisely what I wanted. I have tested it a bit, and so far so good.
Thanks!
Álvaro.
On Tue, Nov 17, 2015 at 7:12 AM, Petr Baudis wrote:
> Hi!
>
> On Tue, Nov 17, 2015 at 07:05:34AM -0500, Álvaro Begué
>
> I am trying to create a database of games to do some machine-learning
> experiments. My requirements are:
> * that all games be played by the same strong engine on both sides,
> * that all games be played to the bitter end (so everything on the board
> is alive at the end), and
> * that
ent: Tuesday, November 17, 2015 6:49 AM
> To: computer-go@computer-go.org
> Subject: Re: [Computer-go] Strong engine that maximizes score
>
> > I am trying to create a database of games to do some machine-learning
> > experiments. My requirements are:
> > * that all games be p
e the score is not compatible with being a strong
>> engine. If you want a dan level engine it is maximizing win-probability.
>>
>> David
>>
>> > -Original Message-
>> > From: Computer-go [mailto:computer-go-boun...@computer-go.org] On
>> Behalf Of
>&
; > Sent: Tuesday, November 17, 2015 6:49 AM
> > To: computer-go@computer-go.org
> > Subject: Re: [Computer-go] Strong engine that maximizes score
> >
> > > I am trying to create a database of games to do some machine-learning
> > > experiments. My requiremen
> Attempting to maximize the score is not compatible with being a
> strong engine. If you want a dan level engine it is maximizing
> win-probability.
If you narrow it down such that komi 25.5, 27.5, and 29.5 give a black
win with 63% to 67% probability, but komi 31.5 jumps to black only
winning
Hi,
I am trying to create a database of games to do some machine-learning
experiments. My requirements are:
* that all games be played by the same strong engine on both sides,
* that all games be played to the bitter end (so everything on the board
is alive at the end), and
* that both sides
12 matches
Mail list logo