chain-graph
Watt chain: 7 pins, and nothing else
A kinematic chain drawn as what it is — a graph. Each disc is a link and carries its number; each line is a pin joining two links. There are no lengths here, no angles and no positions, and every quantity this field computes survives moving any disc anywhere: the picture is a way of reading the graph and not a picture of a machine. The fill says how many pins a link carries — 4 binary, 2 ternary — which is the coarsest thing that can tell two chains apart and the first column of every census table. The count reads two numbers off this picture and nothing else: 6 links and 7 pins give 3 × 5 − 2 × 7 = 1.
The chain before the lengthswide
Where it is used
- The mechanism is the graph The chain before the lengths
- Same links, same pins, different machines The chain before the lengths
- What a count cannot see The chain before the lengths
- Right until the size nobody checked The chain before the lengths
- Deciding that two chains are one The chain before the lengths
- Which link to bolt down The chain before the lengths
- Eight ways to drive it, and one machine The chain before the lengths
- Two to the power of the dyads How many answers
- What has to be solved together The chain before the lengths
- Four that a compass cannot reach The chain before the lengths
- The count was right and the name was wrong What can move
- The candidates a search throws away The chain before the lengths
- Choosing the chain before the lengths The problem backwards
- Eleven assortments and four that are empty The chain before the lengths
- A catalogue is a search space The chain before the lengths
- Six things a chain is not Drawn wrongly
- The chain has no lengths The chain before the lengths
- A graph has no numbers at all The chain before the lengths
- A slide turns nothing The chain before the lengths
- Where the shortest loops are As built
All essaysFieldsThreadsLaddersThe mechanism ledgerRefutationsConceptsSearch