It just happened to me that I now have to study the paper for understanding
how you did this miracle (which will be hard due to my poor level in math)
2016-01-22 5:18 GMT+01:00 John Tromp :
> It's been a long journey, and now it's finally complete!
>
> http://tromp.github.io/go/legal.html
>
> has
dear Erik,
> I was wondering if there is an efficient way to find the number of unique
> positions with symmetrical positions excluded.
It's roughly L19/16.
That's slightly short, but will be correct in the first 85 or so digits.
You just need to correct for the positions with rotational and/or
On Fri, 22 Jan 2016, Adrian Petrescu wrote:
Very cool! I find it interesting that the number is only about 1.2% of 3^361
(though I realize 3^361 doesn't take symmetries into account).
On the surface it's counterintuitive to me that nearly 99% of random stone
configurations are not legal Go p
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, Robert, so many questions!
Many of which I have no idea how to answer:-(
> You must have needed 15 or 20 years of research to find the result?
Very intermittently though. If it were all continuous, it may be
several months of Go research, several more months of article editing,
and a few yea
Hi Adrian,
Take a handful of black and white stones, throw them on a 9x9 board and
check how many times you need to repeat this before you have a legal
position :) Please report your results in case you actually proceed with
this experiment.
best regards,
Jan van der Steen
On 22-01-16 16:5
Very cool! I find it interesting that the number is only about 1.2% of
3^361 (though I realize 3^361 doesn't take symmetries into account). On the
surface it's counterintuitive to me that nearly 99% of random stone
configurations are not legal Go positions!
On Fri, Jan 22, 2016 at 10:50 AM, Xavier
well done !
2016-01-22 5:18 GMT+01:00 John Tromp :
> It's been a long journey, and now it's finally complete!
>
> http://tromp.github.io/go/legal.html
>
> has all the juicy details...
>
> regards,
> -John
> ___
> Computer-go mailing list
> Computer-go@c
> shows how these 57 positions form 13 equivalence classes with respect
> to mirroring/reflection which further reduces to 7 classes when
> considering color symmetry as well.
Correction: that should be 8 (not 7) classes for all symmetries.
-John
___
Co
dear Erik,
> Does the number include symmetrical positions (rotations / mirroring / color
> reversal)?
Yes, of course.
This is also apparent from the table at the bottom listing 57 legal
2x2 positions. Figure 4 on page 5 of our paper
http://tromp.github.io/go/gostate.pdf
shows how these 57 posi
Good joke to render the solution as a board position.
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
Congratulations, John!
Do you want to publish your result in a paper?
(One leading member in the editorial board of the "International Journal
of Game Theory" is interested in such types of results.
Cheers, Ingo.
> Gesendet: Freitag, 22. Januar 2016 um 05:18 Uhr
> Von: "John Tromp"
> An: compu
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
On Thu, Jan 21, 2016 at 11:18:25PM -0500, 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 details...
Congratulations!
(Piece of trivia: Michal Koucky who collaborated on this research is
essentially in t
Very interesting. Thanks John. :)
Aja
On Fri, Jan 22, 2016 at 4: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 details...
>
> regards,
> -John
> ___
>
On 22.01.2016 05:18, John Tromp wrote:
It's been a long journey, and now it's finally complete!
http://tromp.github.io/go/legal.html
Congratulations!
You must have needed 15 or 20 years of research to find the result?
Eventually you heavily rely on computational power. How has it been
possi
16 matches
Mail list logo
