Arrangements

1. What arrangement problems test

An arrangement problem provides a set of entities, a set of positions or categories, and conditions restricting how they can be combined. Entities may be people, books, lectures, houses or vehicles. Positions may be seats, floors, days or ranks. The task is to construct a valid arrangement, identify an unavoidable relationship, count possibilities or determine whether a proposed configuration is feasible.

The basic model is a constraint-satisfaction problem. Each entity has a set of possible positions; each clue removes some possibilities or links two entities. Unlike calculation-heavy questions, these problems reward accurate interpretation, economical notation and systematic elimination. A single overlooked word such as ‘immediately’, ‘only’ or ‘between’ can change the answer.

For a standard one-to-one arrangement, each entity occupies exactly one position and each position contains exactly one entity. However, this must follow from the question. Scheduling problems may allow several events on one day, and grouping problems may permit unequal group sizes. Never silently impose the rules of seating on a different arrangement format.

• Linear: entities occupy a row, queue or ordered sequence.
• Circular: entities occupy positions around a circle, usually with a stated facing direction.
• Spatial: entities occupy floors, rectangular tables or parallel rows.
• Scheduling and assignment: entities are matched with days, subjects, cities or other attributes.

2. Translate words into precise positional relationships

For a row of n positions, number the slots from 1 to n as viewed on the page. If everyone faces north, a person's left corresponds to the page's left; if everyone faces south, it corresponds to the page's right. In mixed-facing arrangements, interpret ‘A is to the left of B’ using B's facing direction, unless the question specifies another reference. Parallel-row problems require both the row and facing direction to be recorded.

Distinguish immediate relationships from general order. ‘A is immediately before B’ creates the ordered block AB. ‘A is before B’ allows intervening entities. ‘Exactly two persons sit between A and B’ gives a positional difference of three in a linear row. ‘A is somewhere between B and C’ normally permits either B–A–C or C–A–B and does not by itself imply consecutive positions.

For circular seating with everyone facing the centre, left is clockwise and right is anticlockwise. These reverse when everyone faces outward. Draw an arrow beside the circle rather than repeatedly reconstructing the rule. Opposite positions exist in the usual equally spaced circular seating model only when the number of seats is even.

In floor problems, write the numbering convention explicitly, such as floor 1 being the lowest. ‘Above’ need not mean immediately above. In schedules, distinguish consecutive calendar days from consecutive listed working days. If the wording leaves more than one interpretation, check the complete question before adding an assumption.

• Convert ‘neither first nor last’ into an immediate exclusion of both endpoints.
• Record ‘not adjacent’ separately; negative clues are easily forgotten during construction.
• Treat ‘either A or B’ according to the stated context; do not assume exclusive choice unless the wording supports it.

3. A systematic solving method

Begin by identifying the entities, available positions and any additional attributes. Draw only the structure needed: numbered slots for a row, a numbered vertical column for floors, or a grid for assignments. Brief notation is useful, but every symbol must have a stable meaning. For example, use AB for an immediate ordered block and A < B for earlier or lower-numbered placement.

Place the most restrictive clues first. Fixed endpoints, exact floor numbers, opposite seats and long consecutive blocks usually reduce possibilities more sharply than broad statements such as ‘P is somewhere before Q’. Next combine linked clues. If A immediately precedes B and B immediately precedes C, treat ABC as one ordered block rather than three independent entities.

Whenever a placement is made, propagate its consequences. Mark occupied positions, remove incompatible choices and apply negative clues. If a slot has only one eligible entity, fill it. In a one-to-one assignment, an entity with only one eligible slot must also be placed there. Such deductions often solve the puzzle without extensive branching.

If uncertainty remains, create explicit cases using a restrictive unresolved clue. For example, test the two possible locations of a three-person block rather than guessing the position of an unrelated person. Keep cases separate, close a branch as soon as it violates a condition, and avoid importing a deduction from one branch into another. Finally, reread every original clue against the surviving configurations.

• For circular puzzles involving only relative positions, fix one person at a reference seat to remove rotational duplication.
• Do not fix an arbitrary reference seat when an absolute direction, numbered seat or other external anchor already matters.
• Use a compact checklist of clues to verify a completed arrangement.

4. Possibility, necessity and counting

Read the question stem before deciding how much construction is necessary. ‘Who must occupy the middle position?’ asks for a feature shared by every valid arrangement. ‘Who can occupy the middle position?’ requires only one valid arrangement demonstrating that possibility. ‘Who cannot occupy it?’ requires showing that the proposed placement contradicts the conditions.

One valid arrangement cannot establish a ‘must be true’ claim unless uniqueness has also been proved. Conversely, one valid counterexample is enough to disprove necessity. If several configurations survive, compare only the feature asked about. The identity of the fifth person may remain fixed even when the first four can exchange places.

For n distinct objects, unrestricted linear arrangements number n factorial. If k specified objects must remain together, treating them as a block gives (n − k + 1) factorial multiplied by k factorial, provided their internal order is unrestricted. If that internal order is fixed, omit the k factorial factor.

For n distinct people around an unlabelled circle, where rotations are equivalent but reflections remain distinct, the unrestricted count is (n − 1) factorial. This formula does not automatically apply to numbered seats or arrangements anchored to compass directions. With multiple restrictions, logical case analysis is often safer than applying a memorised counting formula.

• Must be true: holds in every valid configuration.
• Could be true: holds in at least one valid configuration.
• Cannot be true: holds in no valid configuration.

5. Accuracy and examination strategy

During practice, diagnose the source of each error: misread direction, missed exclusion, uncontrolled branching or incorrect interpretation of necessity. Re-solving a puzzle with a cleaner diagram is more useful than merely reading its answer. Start with single-variable arrangements and then progress to mixed-facing seats and assignments involving several attributes.

In the examination, assess a set before investing heavily in it. A compact puzzle supporting several questions may offer good returns, but repeated branching without new deductions is a warning to move on temporarily. There is no universally correct time limit for every arrangement question; use timed practice to identify your own reliable solving range.

Options can help resolve a specific query. Test candidate answers against the clues when a full arrangement would be unnecessarily expensive. However, accepting the first plausible option is unsafe, particularly in ‘must’ questions. Maintain a distinction between proven deductions and provisional placements, and account for negative marking rather than guessing solely because time has already been spent.

• Common traps include confusing distance with the number of intervening persons and reversing left and right.
• Do not treat a partially filled diagram as proof that all remaining placements will work.
• Before answering, check whether the stem asks for a person, position, pair, count or complete sequence.

Previous year questions

No source-linked PYQ is available here yet. Use the practice questions below.

Practice questions