In this sub-genre of Shortest Proof Games, all surviving units appear on their apparent starting
squares.
In chess compositions, "silence is golden". This means that the diagram should do the talking,
rather than a lengthy stipulation (or a lengthy commentary like this... :-) ). But in Homebase
PGs, the diagrams are silent too! Austere and cold, only the gaps in the ranks tell to those who
would bend an ear the sad yet hauntingly beautiful stories of what has unfolded on the board...
heh.
So on this page are some "homebase" problems, mostly by me except where noted. I have also
collected on another page all prior work I could find by other composers in this area. I would
ideally like to collect all the world's homebase PGs here. ("All your homebases are belong to
us!")
If you solve some of the problems on these pages, you may see that there is one particular task
which adapts itself particularly well to the homebase form...
I also wondered how many "homebase" positions there are of minimum length (4.0) and have
collected them all on another page again.
{C03}
R50 Problemesis 26
Apr 2002
Dedicated to
Thierry le Gleuher
{C01} {C02} Commended - Problemesis
Original Original 2002
{C04}
with Noam D. Elkies {C06}
Phnix {C05} R128 Problemesis 37
Date ??? Original Feb 2004
{C11} {C12}
{C10} R51 Problemesis 26 R52 Problemesis 26
Original Apr 2002 Apr 2002
http://anselan.com/CHE.html 1/2
8/19/2017 HOMEBASE PROOF GAMES
Franois Perruchaud has come up with some great examples of this task...
{C15}
{C13} {C14} Franois Perruchaud
A.G.Buchanan version Franois Perruchaud R96 Problemesis 33
Franois Perruchaud R95 Problemesis 33 Jun 2003
UNPUBLISHED Jun 2003 dedicated to Andrew Buchanan
{C16}
Franois Perruchaud
R97 Problemesis 33
June 2003
{C0} Original:
Finally, as a bonus, can you find the unique "homebase" Illegal Cluster?
Solutions
http://anselan.com/CHE.html 2/2