Figure

Only the sets holding both pins reach the end

Drawn here at the parameters it defaults to, with every essay that calls it.

How many independent constraint sets there are of each size, split by how many of the two pins they hold. Sets with no pin stop at 6, which is the mixed budget; sets with one pin stop at 7; sets with both reach 8 and there are 7596 of them. Nothing at all is independent at 9, which is the statement that a picture of four places has exactly eight numbers in it and they have all been spent.

It is one of 73 figures drawn by the same construction, and the drawing above is this one with nothing changed.

1 essay calls it. Every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.

Where it is called

Changing this changes every one of these figures.

A picture of four places, and the one constraint that is about the sheet. The best flat picture of four world cities, with the six distances it could be asked to hold drawn between the dots and the twelve bearings implied by them. Every one of those is a statement about how two places stand to one another, so every one is blind to where the whole picture sits on the paper. The cross is a constraint of a third kind: a stated position for one place — this dot goes here — which is two numbers and is blind to nothing. Adding both of them takes the largest independent set from 6 to 8.

The impossibility

Two numbers about the paper buy nothing about the places

A picture of n places has four freedoms, and a constraint holds only what its own blindness leaves: distances reach 2n − 3, bearings 2n − 3, the two together 2n − 2. Position is reached by neither, because nothing about how places stand to one another says where on the sheet to put them. A stated position does reach it, and two of them take the budget to 2n exactly. What the count conceals is that the extra two buy nothing: a largest picture holds six place constraints with the pins and six without, the same 7,596 of them, holding the same pairs at the same rates. The constraint system is a direct sum, and a pin is a different currency.

The whole library