That was very interesting, thanks for sharing!
On Fri, Mar 2, 2018 at 9:50 AM, wrote:
> Hi,
> somebody asked me to post my views on 9x9 go on the list based on my
> experience with correspondence go on OGS and little Golem.
>
> I have been playing online correspondence
Hello Aja,
Could you enlighten me on how AlphaZero handles tactics in chess ?
It seems the mcts approach as described in the paper does not perform well
enough.
Leela-chess is not performing well enough even though leela-go seems to be
doing well.
Daniel
On Fri, Mar 2, 2018 at 4:52 AM,
CALL FOR PAPERS: 2018 IEEE Conference on Computational Intelligence and Games
Maastricht University - Department of Data Science & Knowledge Engineering,
Maastricht, The Netherlands, August 14-17, 2018
Hi,
somebody asked me to post my views on 9x9 go on the list based on my
experience with correspondence go on OGS and little Golem.
I have been playing online correspondence tournaments since 2011 with
Valkyria which is a MCTS heavy playout MCTS using AMAF heavily tuned for
9x9. Also with
Do you think deep learning can understand and solve double
ko, for example?
Hideki
Aja Huang:
More curiosity: what about non square boards? Are go programs a cheap way
to explore go in such boards?
:D
Fidel Santiago.
On 02 Mar 2018 12:09, Ingo Althöfer <3-hirn-ver...@gmx.de> wrote:
> Hello,
>
> looking at boards of different sizes, may there
> be some threshold d, such that the Zero
Where is leela chess. How many games it is trained on?
Le 2 mars 2018 18:20, "Dan" a écrit :
> Hello Aja,
>
> Could you enlighten me on how AlphaZero handles tactics in chess ?
>
> It seems the mcts approach as described in the paper does not perform well
> enough.
>
>
HI,
I was informed on the thread of the topic 9x9 go as Mangus had stated some good
points that were similar to mine. Mine are based on my experience of
correspondence go on OGS and GoQuest.
I have been playing online go 2011 with Deep Scholar which originally was Fuego
with large GoQuest
Leela chess is here https://github.com/glinscott/leela-chess
It uses the exact MCTS algorithm as described in AlphaZero, with value and
policy networks, but performs really badly in tactics (often missing 2-3
ply shallow tactics)
To get a somewhat strong MCTS chess engine, I had to use
Hello,
looking at boards of different sizes, may there
be some threshold d, such that the Zero approach
is in particular successfull for all boards larger
than dxd und less successfull for boards smaller
than dxd? Or does duccess increase gradually
with board size?
Second question: Go may also
2018-03-02 6:50 GMT+00:00 "Ingo Althöfer" <3-hirn-ver...@gmx.de>:
> Von: "David Doshay"
> > Go is hard.
> > Programming is hard.
> >
> > Programming Go is hard squared.
> > ;^)
>
> And that on square boards.
> Mama mia!
>
Go is hard for humans, but in my own opinion I think Go
11 matches
Mail list logo