dear Go researchers,
>> > Found a 582 move 3x3 game...
>> Can you give us sgf?
>
> I took the effort of trying to format the 582 game in a more insightful way.
> I ended up with lines of positions that mostly add stones, only starting
> a new line when a capture of more than 1 stone left at most 4
dear Ingo,
>>> ... (1 + delta)^(m*n).
>>
>> This is true, and a delta > 2 follows from a Theorem in an
>> upcoming paper by Matthieu Walraet and myself.
>
> Do you mean (1+delta) > 2, or really (1+delta) > 3?
Oops; I mean delta >= 1, so the base of the exponent is at least 2.
(1+delta) is necess
Dear John,
thanks for the explanations (and paper announcement).
>> ... (1 + delta)^(m*n).
>
> This is true, and a delta > 2 follows from a Theorem in an
> upcoming paper by Matthieu Walraet and myself.
Do you mean (1+delta) > 2, or really (1+delta) > 3?
> > Might neural nets help to find (v
On Sun, Feb 21, 2016 at 09:00:54PM +0100, Petr Baudis wrote:
> I'm wondering if there's some framework for studying combinatoric
> aspects of games that are not only technically Go, but also actually
> resemble real Go games played by competent players?
>
> This research doesn't touch my heart
Hi!
On Sun, Feb 21, 2016 at 01:55:05PM -0500, John Tromp wrote:
> > very interesting. Is it allowed for players
> > to pass in between? Do these passes count like
> > normal moves?
>
> Yes, passes are implied whenever two consecutively played stones
> are of the same color.
I'm wondering if
dear Darren, Ingo,
> Again by random sampling?
Yes, nothing fancy.
> Are there certain moves(*) that bring games to an end earlier, or
> certain moves(*) that make games go on longer? Would weighting them
> appropriately in your random playouts help?
You could try to weigh moves by how likely t
Hi John,
very interesting. Is it allowed for players
to pass in between? Do these passes count like
normal moves?
> Found a 582 move 3x3 game...
Can you give us sgf?
My intuition says that there should be a constant
delta > 0 such that for all board sizes m x n (with
m > 1, n > 1) there exist
As the smoke cleared, Darren Cook
mounted the barricade and roared out:
> >> The longest I've been able to find, by more or less random sampling,
> >> is only 521 moves,
> >
> > Found a 582 move 3x3 game...
Is AlphaGo 'aware' of this database..?
-- grok.
___
>> The longest I've been able to find, by more or less random sampling,
>> is only 521 moves,
>
> Found a 582 move 3x3 game...
Again by random sampling?
Are there certain moves(*) that bring games to an end earlier, or
certain moves(*) that make games go on longer? Would weighting them
appropria
> The longest I've been able to find, by more or less random sampling,
> is only 521 moves,
Found a 582 move 3x3 game...
regards,
-John
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
dear Go researchers,
Finding the maximum length of a Go game, if we measure length
by number of (non-pass) moves, is equivalent to finding the longest
simple path in the game graph.
For 2x2 this can easily be brute forced, and one finds a maximum
length of 48 moves (so a single game can visit at
11 matches
Mail list logo