Groups
Conversations
All groups and messages
Send feedback to Google
Help
Sign in
Groups
sprouts-theory
Conversations
About
sprouts-theory
1–30 of 45
Mark all as read
Report abusive group
0 selected
Josh Jordan
3/6/11
Analysis of 2011 "Clash of the Titans" Game 2
(For diagrams, see http://www.files.takingthefun.com/sprouts/2011clashgame2/) 22- (Khorkov - Jordan+
unread,
Analysis of 2011 "Clash of the Titans" Game 2
(For diagrams, see http://www.files.takingthefun.com/sprouts/2011clashgame2/) 22- (Khorkov - Jordan+
3/6/11
Julien Lemoine
2/28/11
Glop 2.0 release
Hi, we are happy to announce that we have released Glop 2.0 http://sprouts.tuxfamily.org/ On this
unread,
Glop 2.0 release
Hi, we are happy to announce that we have released Glop 2.0 http://sprouts.tuxfamily.org/ On this
2/28/11
Josh Jordan
,
Jean-François Peltier
2
2/17/11
2011 "Clash of the Titans" Game 1: a post-mortem
Congratulations for this great analysis! What a game, that pushes Sprouts some levels up! Move 40 is
unread,
2011 "Clash of the Titans" Game 1: a post-mortem
Congratulations for this great analysis! What a game, that pushes Sprouts some levels up! Move 40 is
2/17/11
Josh Jordan
2/13/11
The Computational Complexity of Sprouts
In [1] it is shown that the problem of determining whether play from an arbitrary sprouts position
unread,
The Computational Complexity of Sprouts
In [1] it is shown that the problem of determining whether play from an arbitrary sprouts position
2/13/11
Julien Lemoine
,
danny purvis
3
12/21/10
news about Glop
> Thanks for this update. Congratulations on your continued progress. Would > it be okay for me
unread,
news about Glop
> Thanks for this update. Congratulations on your continued progress. Would > it be okay for me
12/21/10
Josh Jordan
6/20/10
The game of Weeds
Weeds [1] is a variation of Sprouts in which the player has the option to NOT add a new spot on the
unread,
The game of Weeds
Weeds [1] is a variation of Sprouts in which the player has the option to NOT add a new spot on the
6/20/10
Josh Jordan
, …
Jean-François Peltier
8
6/2/10
4 spots = {*3,{*1,*2,{*3,{*2}}}}
Thanks Dan for making it right (I keep forgetting what heaps are in the context of directed graphs).
unread,
4 spots = {*3,{*1,*2,{*3,{*2}}}}
Thanks Dan for making it right (I keep forgetting what heaps are in the context of directed graphs).
6/2/10
Josh Jordan
2
6/1/10
Genus theory classification of the Lemoine-Viennot list of reduced games with up to 6 initial spots
Oops, when I wrote, 4 spots is Wild of Restive Genus with nim-values 1^0, I should have written: 4
unread,
Genus theory classification of the Lemoine-Viennot list of reduced games with up to 6 initial spots
Oops, when I wrote, 4 spots is Wild of Restive Genus with nim-values 1^0, I should have written: 4
6/1/10
Julien Lemoine
,
Josh Purinton
2
9/1/09
Misere article
Outstanding work. Although I know that Julien and Simon are more interested in theory, I personally
unread,
Misere article
Outstanding work. Although I know that Julien and Simon are more interested in theory, I personally
9/1/09
Yper Cube
3
2/2/09
Types of equivalence
Correction for definitions 4M and 4NM: Def.4M (type 4M) : for two positions G, H, and a (position of
unread,
Types of equivalence
Correction for definitions 4M and 4NM: Def.4M (type 4M) : for two positions G, H, and a (position of
2/2/09
Yper Cube
, …
Dan Hoey
6
1/30/09
Fwd: Sprouts equivalences
I wrote: > Yper Cube wrote: > >> We obviously don't have the same results for the Q_n
unread,
Fwd: Sprouts equivalences
I wrote: > Yper Cube wrote: > >> We obviously don't have the same results for the Q_n
1/30/09
Dan Hoey
,
Dan Hoey
2
1/30/09
A lousy periodicity theorem
I wrote: > A "louse" is a boundary > consisting of a single degree-2 point that does
unread,
A lousy periodicity theorem
I wrote: > A "louse" is a boundary > consisting of a single degree-2 point that does
1/30/09
Dan Hoey
,
Yper Cube
12
1/26/09
A new equivalence
On Sun, Jan 25, 2009 at 11:18 PM, Dan Hoey <haoyuep@aol.com> wrote: With regard to }1A.} = *[1]
unread,
A new equivalence
On Sun, Jan 25, 2009 at 11:18 PM, Dan Hoey <haoyuep@aol.com> wrote: With regard to }1A.} = *[1]
1/26/09
Dan Hoey
, …
Dan Hoey
8
1/22/09
Re: Sprouts notation
I propose using parentheses in this neo-Glop notation in a different way: Parentheses can enclose a
unread,
Re: Sprouts notation
I propose using parentheses in this neo-Glop notation in a different way: Parentheses can enclose a
1/22/09
Dan Hoey
1/22/09
Re: Chained pivot/loop notation: a proposal
"Josh Purinton" <josh.purinton@gmail.com> wrote to suggest that the neo-Glop-notation
unread,
Re: Chained pivot/loop notation: a proposal
"Josh Purinton" <josh.purinton@gmail.com> wrote to suggest that the neo-Glop-notation
1/22/09
lap...@tuxfamily.org
, …
Josh Purinton
14
1/20/09
17-
On Tue, Jan 20, 2009 at 2:02 PM, <lapinot@tuxfamily.org> wrote: > You're right when you
unread,
17-
On Tue, Jan 20, 2009 at 2:02 PM, <lapinot@tuxfamily.org> wrote: > You're right when you
1/20/09
Josh Purinton
, …
DannyPurvis
17
1/7/09
Chained pivot/loop notation: a proposal
> I think Roman *already* plays his moves this way, except perhaps at > the very end of the
unread,
Chained pivot/loop notation: a proposal
> I think Roman *already* plays his moves this way, except perhaps at > the very end of the
1/7/09
Josh Purinton
,
Roman
3
1/5/09
A T1 counterexample
2009/1/5 Roman <begbie@list.ru>: > k=11: no choice Gx (x>1) (any move creates G0) This
unread,
A T1 counterexample
2009/1/5 Roman <begbie@list.ru>: > k=11: no choice Gx (x>1) (any move creates G0) This
1/5/09
Roman
,
Josh Purinton
2
1/5/09
n=5 simple counterexample to the old theorem
2009/1/5 Roman <begbie@list.ru>: > 5+3+1L2=Gx,x>1 (misere game) According to Aunt Beast,
unread,
n=5 simple counterexample to the old theorem
2009/1/5 Roman <begbie@list.ru>: > 5+3+1L2=Gx,x>1 (misere game) According to Aunt Beast,
1/5/09
Josh Purinton
, …
danny purvis
11
1/4/09
Need help explaining a Khorkov misere rule-of-thumb
After 15- 1(16)2 6(17)6[1-5] 7(18)8 6(19)17[7-10] 10(20)18 11(21)12 7(22)8 22(23@10)8 15(24)15[19] 13
unread,
Need help explaining a Khorkov misere rule-of-thumb
After 15- 1(16)2 6(17)6[1-5] 7(18)8 6(19)17[7-10] 10(20)18 11(21)12 7(22)8 22(23@10)8 15(24)15[19] 13
1/4/09
Josh Purinton
1/4/09
16- is a win for Left
After about 10 days of computation, Aunt Beast has verified via exhaustive search that 1(17)1[2-4] is
unread,
16- is a win for Left
After about 10 days of computation, Aunt Beast has verified via exhaustive search that 1(17)1[2-4] is
1/4/09
DannyPurvis
, …
Dan Hoey
6
12/29/08
Focardi and Luccio
lapinot@tuxfamily.org wrote: > Hi Dan, > > you should have a look to these positions (in
unread,
Focardi and Luccio
lapinot@tuxfamily.org wrote: > Hi Dan, > > you should have a look to these positions (in
12/29/08
Josh Purinton
, …
Dan Hoey
6
12/16/08
Further thoughts on Peltier-Purvis
On Tue, Dec 16, 2008 at 12:01 PM, Josh Purinton <josh.purinton@gmail.com> wrote: I asked Aunt
unread,
Further thoughts on Peltier-Purvis
On Tue, Dec 16, 2008 at 12:01 PM, Josh Purinton <josh.purinton@gmail.com> wrote: I asked Aunt
12/16/08
danny purvis
12/13/08
Fw: Need help explaining a Khorkov misere rule-of-thumb
Three Stooges is right. I now realize that the diagram I was looking at when I wrote this already had
unread,
Fw: Need help explaining a Khorkov misere rule-of-thumb
Three Stooges is right. I now realize that the diagram I was looking at when I wrote this already had
12/13/08
Josh Purinton
, …
Yper Cube
12
12/12/08
Dan Hoey's ideas on Sprouts position representation
A correction on the previous post and an addition. On Wed, Dec 10, 2008 at 7:08 PM, Yper Cube <
unread,
Dan Hoey's ideas on Sprouts position representation
A correction on the previous post and an addition. On Wed, Dec 10, 2008 at 7:08 PM, Yper Cube <
12/12/08
Josh Purinton
,
danny purvis
2
12/12/08
"A graph drawing algorithm for the game of sprouts"
I stumbled on this paper the other but have not had time to pursue it. I should mention it on the
unread,
"A graph drawing algorithm for the game of sprouts"
I stumbled on this paper the other but have not had time to pursue it. I should mention it on the
12/12/08
Josh Purinton
,
lap...@tuxfamily.org
2
12/9/08
Does reversing boundaries yield an equivalent position? (Was: Re: Dan Hoey's ideas on Sprouts position representation)
Le Tue, 9 Dec 2008 00:03:37 -0500, "Josh Purinton" <josh.purinton@gmail.com> a écrit
unread,
Does reversing boundaries yield an equivalent position? (Was: Re: Dan Hoey's ideas on Sprouts position representation)
Le Tue, 9 Dec 2008 00:03:37 -0500, "Josh Purinton" <josh.purinton@gmail.com> a écrit
12/9/08
Josh Purinton
,
Jeff Peltier
11
3/26/08
Re: glossary: fickle and firm
Here's the final version. Thanks to Dan Hoey and Jeff Peltier for their many suggestions and
unread,
Re: glossary: fickle and firm
Here's the final version. Thanks to Dan Hoey and Jeff Peltier for their many suggestions and
3/26/08
Dan Hoey
,
Josh Purinton
3
3/24/08
Re: glossary: fickle and firm
> Did you have any time to form an impression of my "Tame Game" > conjecture? >
unread,
Re: glossary: fickle and firm
> Did you have any time to form an impression of my "Tame Game" > conjecture? >
3/24/08
Josh Purinton
2
3/21/08
Tame game conjecture
On Fri, Mar 21, 2008 at 5:42 PM, Aaron Siegel <aaron.n.siegel@gmail.com> wrote: Is the
unread,
Tame game conjecture
On Fri, Mar 21, 2008 at 5:42 PM, Aaron Siegel <aaron.n.siegel@gmail.com> wrote: Is the
3/21/08
Search
Clear search
Close search
Google apps
Main menu