Congratulations John!
Does the number include symmetrical positions (rotations / mirroring /
color reversal)?
Best,
Erik
On Fri, Jan 22, 2016 at 5:18 AM, John Tromp wrote:
> It's been a long journey, and now it's finally complete!
>
> http://tromp.github.io/go/legal.html
>
> has all the juicy
Thanks, I though so, but I just wanted to make sure. So all numbers in this
sequence must be odd because of color symmetry + 1 for the empty board.
I was wondering if there is an efficient way to find the number of unique
positions with symmetrical positions excluded.
Erik
On Fri, Jan 22, 2016
Wow, excellent results, congratulations Aja & team!
I'm surprised to see nothing explicitly on decomposing into subgames (e.g.
for semeai). I always thought some kind of adaptive decomposition would be
needed to reach pro-strength... I guess you must have looked into this;
does this mean that the
This fluctuating sentiment on artificial neural networks is a bit weird;
popularity comes and goes in waves, and many academics appear to be just
following the hype. Most of the stuff I learned on ANN's in the 90s and
early zeros just works, and now we can see that if one throws huge
computational
Don't think so, for most people it was already 'over' years ago, but Go has
a great handicap system :-)
Op 20 feb. 2016 17:53 schreef Ingo Althöfer <3-hirn-ver...@gmx.de>:
> Possibly the last opportunity before "game over".
>
> Ingo.
>
>
> *Gesendet:* Samstag, 20. Februar 2016 um 15:38 Uhr
> *Von:
The most important skill in this game might be in how accurately you can
throw your frisbee. Why take that out? Build real robots!
;-)
Erik
On Mon, Feb 22, 2016 at 4:42 PM, "Ingo Althöfer" <3-hirn-ver...@gmx.de>
wrote:
> Dear John, Dear Nick, Dear all,
>
> > > ...
> > > Suppose I want to play on
On Tue, Feb 23, 2016 at 4:41 PM, Justin .Gilmer wrote:
> I made a similar attempt as Alvaro to predict final ownership. You can
> find the code here: https://github.com/jmgilmer/GoCNN/. It's trained to
> predict final ownership for about 15000 professional games which were
> played until the end
Very impressive results so far!
If it's going to be a clean sweep, I hope we will get to see some handicap
games :-)
Erik
On Thu, Mar 10, 2016 at 12:04 PM, Petr Baudis wrote:
> In the press conference (https://youtu.be/l-GsfyVCBu0?t=5h40m00s), Lee
> Sedol said that while he saw some questiona
Congratulations Aja & Deepmind team!
Now that the victory is clear, perhaps you can say a bit more on the latest
developments? Any major scientific breakthroughs beyond what we already
know from the Nature paper?
Enjoy the moments!
Erik
On Sat, Mar 12, 2016 at 9:53 AM, Aja Huang wrote:
> Tha
On Thu, Apr 21, 2016 at 1:20 PM, "Ingo Althöfer" <3-hirn-ver...@gmx.de>
wrote:
> Likely it is almost impossible for neural nets of "moderate" size
> to identify life/death stati of a groups.
>
No. Neural nets (even shallow ones like we used over a decade ago) are
quite capable to identify life/de
Or switch to McMahon / Handicaps
On Wed, May 4, 2016 at 4:18 PM, Sebastian Scheib
wrote:
> That would be good, something like in other sports where you have a first,
> second and so... categories.
>
> 2016-05-04 11:00 GMT-03:00 Jim O'Flaherty :
>
>> Hmmm...if bots weaker than GnuGo are actively
Why not McMahon? (possibly with reduced handicap). It works fine in human
Go tournaments.
IMO KGS Swiss is pretty boring for most of the time, and the scheduler
often seems to have a lot of undesired influence on the final ranking. Also
at this point I'm really not that interested any more to see
d, eight not.
>
> Nick
>
> On 9 May 2016 at 22:16, Erik van der Werf
> wrote:
>
>> Why not McMahon? (possibly with reduced handicap). It works fine in
>> human Go tournaments.
>>
>> IMO KGS Swiss is pretty boring for most of the time, and the scheduler
Oh that's silly! IIRC if your bot is not ranked than users can do all kind
of cheating in the scoring phase (e.g., mark all your living stones dead).
On Tue, May 10, 2016 at 12:07 AM, Gian-Carlo Pascutto wrote:
> On 10/05/2016 0:01, Erik van der Werf wrote:
> > Well then why n
I've seen the same thing some years ago; it did not happen for all versions
of GoGui...
On Wed, Sep 7, 2016 at 6:42 PM, wrote:
> Hi,
>
> I just think I found a bug in twogtp 1.4.8 (windows), using the -alternate
> flag and two programs that always resign if losing.
>
> Basically the winner is w
Hi Ingo, The SGF file you sent is malformed (in this case it's only a
minor issue for the date field, but some sgf viewers reject it).
Do you know which program was used to create it? (the AP property
suggests Many Faces, but it also containes the non-standard MULTIGOGM
property suggesting it came
On Thu, Dec 8, 2016 at 10:58 PM, "Ingo Althöfer" <3-hirn-ver...@gmx.de> wrote:
> Playing under such conditions might be a challenge for the bots
Why? Do you think the humans will collude? ;-)
Erik.
___
Computer-go mailing list
Computer-go@computer-go.o
Detlef, I think your result makes sense. For games between
near-equally strong players the winning player's moves will not be
much better than the loosing player's moves. The game is typically
decided by subtle mistakes. Even if nearly all my moves are perfect,
just one blunder can throw the game.
On Sun, Dec 11, 2016 at 8:44 PM, Detlef Schmicker wrote:
> Hi Erik,
>
> as far as I understood it, it was 250ELO in policy network alone ...
Two problems: (1) it is a self-play result, (2) the policy was tested
as a stand-alone player.
A policy trained to win games will beat a policy trained to
On Sat, Feb 25, 2017 at 12:30 AM, Brian Sheppard via Computer-go <
computer-go@computer-go.org> wrote:
> In retrospect, I view Schradolph’s paper as evidence that neural networks
> have always been surprisingly successful at Go. Like Brugmann’s paper about
> Monte Carlo, which was underestimated f
On Mon, Feb 27, 2017 at 4:30 PM, Darren Cook wrote:
> > But those video games have a very simple optimal policy. Consider Super
> Mario:
> > if you see an enemy, step on it; if you see a whole, jump over it; if
> you see a
> > pipe sticking up, also jump over it; etc.
>
> A bit like go? If you se
On Mon, May 22, 2017 at 10:08 AM, Gian-Carlo Pascutto wrote:
>
> ... This heavy pruning
> by the policy network OTOH seems to be an issue for me. My program has
> big tactical holes.
Do you do any hard pruning? My engines (Steenvreter,Magog) always had a
move predictor (a.k.a. policy net), but I
On Mon, May 22, 2017 at 11:27 AM, Erik van der Werf <
erikvanderw...@gmail.com> wrote:
> On Mon, May 22, 2017 at 10:08 AM, Gian-Carlo Pascutto
> wrote:
>>
>> ... This heavy pruning
>> by the policy network OTOH seems to be an issue for me. My program has
>>
On Mon, May 22, 2017 at 3:56 PM, Gian-Carlo Pascutto wrote:
> On 22-05-17 11:27, Erik van der Werf wrote:
> > On Mon, May 22, 2017 at 10:08 AM, Gian-Carlo Pascutto > <mailto:g...@sjeng.org>> wrote:
> >
> > ... This heavy pruning
> > by the policy n
The Chinese counting looked so confusing :-)
On Tue, May 23, 2017 at 9:02 AM, Jim O'Flaherty
wrote:
> I have now heard that AlphaGo one by 0.5 points.
>
>
> On Tue, May 23, 2017 at 2:00 AM, Jim O'Flaherty <
> jim.oflaherty...@gmail.com> wrote:
>
>> The announcer didn't have her mic on, so I coul
On Mon, May 22, 2017 at 4:54 PM, Gian-Carlo Pascutto wrote:
> On 22-05-17 15:46, Erik van der Werf wrote:
> > Anyway, LMR seems like a good idea, but last time I tried it (in Migos)
> > it did not help. In Magog I had some good results with fractional depth
> > reductions
On Tue, May 23, 2017 at 10:51 AM, Hideki Kato
wrote:
> Agree.
>
> (1) To solve L&D, some search is necessary in practice. So, the
> value net cannot solve some of them.
> (2) The number of possible positions (input of the value net) in
> real games is at least 10^30 (10^170 in theory). If the v
Yup, looks like something broke. Here everything that was sent after the
23rd only arrived today (June 7)... Ah well, it's game-over anyway :-)
On Mon, May 29, 2017 at 7:51 AM, J. van der Steen <
j.van.der.st...@gobase.org> wrote:
>
> Hi all,
>
> Is there something wrong with the mailing list? I
On Mon, Aug 7, 2017 at 12:52 PM, Darren Cook wrote:
> > https://en.wikipedia.org/wiki/Brute-force_search explains it as
> > "systematically enumerating all possible candidates for the
> > solution".
> >
> > There is nothing systematic about the pseudo random variation
> > selection in MCTS;
>
> M
361! seems like an attempt to estimate an upper bound on the number of
games where nothing is captured.
On Wed, Aug 9, 2017 at 2:34 PM, Gunnar Farnebäck
wrote:
> Except 361! (~10^768) couldn't plausibly be an estimate of the number of
> legal positions, since ignoring the rules in that case give
Good point, Roel. Perhaps in the final layers one could make it predict a
model of the expected score distribution (before combining with the komi
and other rules specific adjustments for handicap stones, pass stones,
last-play parity, etc.). Should be easy enough to back-propagate win/loss
informa
No need for AlphaGo hardware to find out; any toy problem will suffice to
explore different initialization schemes... The main benefit of starting
random is to break symmetries (otherwise individual neurons cannot
specialize), but there are other approaches that can work even better.
Further you ty
I didn't see the games, but I suppose they simply made the rookie mistake
of playing (too many) stones inside own territory while the opponent was
passing...
Op 2 jan. 2018 22:09 schreef "Adrian Petrescu" :
I'm not sure I understand this rule. Why should a player forfeit because
they did not pas
Normal handicap games with 0.5 komi favor Black by only half a stone/grade
compensation (so if there is a full grade difference in strength White
still has an advantage). Two handicap stones with normal komi just corrects
for one stone/grade strength difference (just like one handicap stone with
re
In the old days I trained separate move predictors on 9x9 games and on
19x19 games. In my case, the ones trained on 19x19 games beat the ones
trained on 9x9 games also on the 9x9 board. Perhaps it was just because of
was having better data from 19x19, but I thought it was interesting to see
that th
On Thu, Dec 6, 2018 at 11:28 PM Rémi Coulom wrote:
> Also, the AlphaZero algorithm is patented:
> https://patentscope2.wipo.int/search/en/detail.jsf?docId=WO2018215665
>
So far it just looks like an application (and I don't think it will be be
difficult to oppose, if you care about this)
Erik
_
> On Thu, Dec 6, 2018, 4:13 PM Jim O'Flaherty <
>>>>>>> jim.oflaherty...@gmail.com wrote:
>>>>>>>
>>>>>>>> Remember, patents are a STRATEGIC mechanism as well as a legal
>>>>>>>> mechanism. As soon as a paten
Thanks Remi! Nice to see that GoGui is still alive :-)
FYI the included version of gogui-twogtp has a bug (which has been around
for many years) where the '-alternate' option causes incorrect results in
the game records.
Happy New Year to all!
Erik
On Sat, Nov 17, 2018 at 6:50 PM Hiroshi Yamash
t;
> - Mail original -----
> De: "Erik van der Werf"
> À: "computer-go"
> Envoyé: Mardi 1 Janvier 2019 18:24:40
> Objet: Re: [Computer-go] GoGui 1.5.0
>
>
>
>
> Thanks Remi! Nice to see that GoGui is still alive :-)
>
>
> FYI the included v
It looks like gmail is broken again for this list. I never got Remi's
original post (not even in my spam folder). I can only see it in the
archive.
Erik
On Sat, Feb 16, 2019 at 5:50 PM J. van der Steen
wrote:
>
> And most important:
>
>* Does ELF know the meaning of life?
>
> On 16/02/2019
Hi Stephen,
I'm not aware of recent published work. There is an ancient document by
Antti Huima on hash schemes for easy symmetry detection/lookup.
Unfortunately his implementation was broken, but other schemes have been
proposed that solve the issue (I found one myself, but I think many others
fo
Apparently it's not so easy to keep a mailing list running smoothly... For
now at least we can still see archives at:
https://www.mail-archive.com/computer-go@computer-go.org/
On Thu, Aug 29, 2019 at 4:14 PM Adrian Petrescu wrote:
> Indeed, I think a lot of aspects of the mailing list software
es were made. IIRC it was
> nearly a unique key for pro positions.
>
> Best,
> Brian
>
> -Original Message-
> From: Erik van der Werf
> To: computer-go
> Sent: Tue, Sep 17, 2019 5:55 am
> Subject: Re: [Computer-go] Indexing and Searching Go Positions --
>
ed a few minutes ago.
>
> *Stephen Martindale*
>
> +49 160 950 27545
> stephen.c.martind...@gmail.com
>
>
> On Tue, 17 Sep 2019 at 17:01, Erik van der Werf
> wrote:
>
>> https://www.real-me.net/ddyer/go/signature-spec.html
>>
>> On Tue, Sep 17, 2019 a
201 - 244 of 244 matches
Mail list logo
