[Retros] At Home SPG-4.0
Andrew Buchanan
andrew at anselan.com
Fri Jan 23 00:45:37 EST 2004
Francois
Thanks for your mail. Nice to get your confirmations, I will update my
webpage.
>I noticed you had one SPG-4.0 with 2 solutions on your webpage. If you
>open the door to those, you'd get 12 more SPGs.
With double solutions, the idea is to get 2 sets of moves which are as
independent as possible. In the one that appears on the webpage, it is a
definite flaw that the two solutions share the first move. How do your 12
SPGs compare from this perspective?
>It turns out that for an "at home" search, ply 9 and 10 are within reach.
>Would that be of interest too? I'm starting the computation now. Any
>guesses as to how many dual-free deletion SPGs there are at ply 9 and 10?
I imagine there may be hundreds. It might be nice to have a file, to trawl
through to see if there are any particularly interesting ones.
There are some other SPG challenges which I would also be interested in
cataloguing:
(1) checkmates.
The shortest is 1.e4 f5 2.exf5 g5 3.Qh5#.
(2) mirror-symmetric positions in an *odd* number of plys (i.e. no shorter
SPG in an even number of plys exists).
Here are four "originals", all SPG 3.5. (Well I *think* Jonathan's is
original.)
rnb1kbnr/pppp1ppp/8/3Qp3/3qP3/8/PPPP1PPP/RNB1KBNR
rnb1kb1r/pppp1ppp/5n2/4p3/4P3/5N2/PPPP1PPP/RNB1KB1R by A.J.Mestel
rnb1kbnr/Qp1ppppp/8/2p5/2P5/8/qP1PPPPP/RNB1KBNR
rnb1kbnr/pQ1ppppp/2p5/8/8/2P5/Pq1PPPPP/RNB1KBNR (just a variant of the
previous one).
There is no attempt to be exhaustive here.
Cheers,
Andrew.
----- Original Message -----
From: "Francois Labelle" <flab at EECS.Berkeley.EDU>
To: <retros at janko.at>
Sent: Monday, January 19, 2004 2:36 PM
Subject: [Retros] At Home SPG-4.0
On Fri, 16 Jan 2004, Andrew Buchanan wrote:
> - an "at home" SPG is an SPG where all the surviving pieces are
> apparently on their start squares. (aka "deletion", "chez soi".)
>
> - it is strongly suspected that there are no shorter deletion SPGs
> (except the trivial one at ply 0). Can you confirm this,
It's a nice problem! It wasn't hard at all to program. The word
"apparently" in the definition helped a lot.
I confirm that there are no dual-free proof games for plies 1-7. At ply 7
there are 9 proof games with multiple solutions (the minimum being 3
solutions for the empty squares b1 and d7).
> and give the list of all deletion SPGs at ply 8? That would be
> impressive.
There are 10 of them. You had #1,2,3,6,7,9,10 on your webpage, #8 is
mentioned on the solution page, #5 is CP01 from your prior art page, and
#4 is just its mirror image. (May I suggest that all 10 appear on the same
webpage?). 10/10, props to all human composers involved!
Francois Labelle & computer, January 19, 2004
All 10 "at home" SPG-4.0 (all rediscoveries)
_________________ _________________ _________________ _________________
| | | | |
| r n . q k b n r | r n b q k b n r | r n b . k b n r | r . b q k b n r |
| p p p . p p p p | p p p . p . p p | p p . . p p p p | p p p . . p p p |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| P P P P P P P P | P P P P P P P P | P P P P P P P P | P P P P P P P P |
| R . B Q K B N R | R . B Q K B N R | R . B Q K B N R | R . B Q K B N R |
|_________________|_________________|_________________|_________________|
| | | | |
| r n b q k b . r | . n b q k b n r | r n . q k b n r | r n b q k b n r |
| p p p . . p p p | p p p p . p p p | p p p . p p p p | p p p p p p p . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . | . . . . . . . . | . . . . . . . . |
| P P P P P P P P | P P P P P P P P | P P . P P P P P | P P P P . P P P |
| R N B Q K B . R | R N B Q K B . R | R N B Q K B N R | R N B . K B N R |
|_________________|_________________|_________________|_________________|
| | |
| r n b q k b n r | r . b q k b n r |
| p p p p p p . p | p p p p p p p p |
| . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . |
| . . . . . . . . | . . . . . . . . |
| P P P P . P P P | P P P . P P P P |
| R N B . K B N R | R N . Q K B N R |
|_________________|_________________|
I noticed you had one SPG-4.0 with 2 solutions on your webpage. If you
open the door to those, you'd get 12 more SPGs. Allowing any number of
solutions, there are a total of 64 SPGs and 10 non-shortest PGs at ply 8.
It turns out that for an "at home" search, ply 9 and 10 are within reach.
Would that be of interest too? I'm starting the computation now. Any
guesses as to how many dual-free deletion SPGs there are at ply 9 and 10?
Cheers,
Francois Labelle
_______________________________________________
Retros mailing list
Retros at janko.at
http://www.pairlist.net/mailman/listinfo/retros
More information about the Retros
mailing list