Given a solution to Kirkman's *School Girl Problem*, it is of course easy enough to check that it actually *is* a solution. But how could you reconstruct it if you lost it? Is there a method or algorithm for constructing a solution which is easier to remember than the actual solution?

There are many combinatorial problems that have such memorable solutions:

In the related *Tournament Scheduling Problem* you fix one player and rotate the remaining $n-1$ players.

In the *Transylvanian Lottery Problem* you divide the 14 points into 2 Fano planes and consider the 7 lines in each Fano plane.

And doubtless many others (which it might also be interesting to list).