Box / Scheduling Puzzle: 48-Hour Exam Crash Guide

Box / Scheduling Puzzle: 48-Hour Exam Crash Guide

What Is This?

A box/scheduling puzzle is a logic-based problem where you must assign items (people, tasks, objects) to containers (boxes, time slots, rooms) under strict constraints. The goal is to determine which item goes where—or prove that no valid arrangement exists.

Why it’s on your exam: - Tests deductive reasoning, constraint satisfaction, and systematic elimination. - Appears in aptitude tests (e.g., SHL, PwC, McKinsey), coding interviews (e.g., Google, Amazon), and certification exams (e.g., CFA, PMP). - Questions typically ask: - "Which box contains X?" - "Is this arrangement possible?" - "What’s the earliest time Y can start?"

Why It Matters

Real-world use: Scheduling shifts, allocating server resources, or designing supply chains.

Core Concepts

Master these before attempting questions:

1. Constraints are absolute.
2. If the problem says "Box A cannot contain a red ball," never put a red ball in Box A—even if it seems to fit elsewhere.

3. Examiner trap: They’ll include a "tempting" option that violates one constraint.

4. Process of elimination (POE) is your best friend.

5. Cross out impossible options first, then fill in the gaps.

6. Example: If Box 1 can’t hold Item X, and Box 2 is full, Item X must go in Box 3.

7. Order matters in scheduling.

8. A task scheduled at 9 AM cannot start at 10 AM unless the problem allows it.

9. Key term: Precedence constraints (e.g., "Task B must start after Task A finishes").

10. Negative information is just as useful as positive.

11. "Box 3 does not contain the blue key" tells you exactly where the blue key isn’t.

12. Look for "anchor" clues.

13. A clue like "The red box is immediately to the left of the blue box" gives you a fixed pair to build around.

The Rule-Book (How It Works)

1. Primary Rule: Constraint Satisfaction

• You have items (e.g., people, tasks) and containers (e.g., boxes, time slots).
• Each item must be assigned to exactly one container, following all given rules.
• If a rule is broken, the entire arrangement is invalid.

2. Sub-Rules & Edge Cases

3. Visual Pattern: The Grid Method

• Draw a table with containers (boxes/time slots) as columns and items as rows.
• Fill in ? (possible), ? (impossible), or ? (unknown).
• Example:

Mnemonic: "If it’s not a ?, it might be a ?—but only if nothing else fits."

Exam / Job / Audit Weighting

• Frequency: 70% of aptitude tests include 1–2 questions.
• Difficulty Rating: Intermediate (easy if you use POE; hard if you guess).
• Question Type:
• Multiple-choice (e.g., "Which box contains the red ball?").
• True/False (e.g., "Is this schedule possible?").
• Short-answer (e.g., "List the order of tasks").

Difficulty Level

Intermediate (requires structured thinking, but no advanced math).

Must-Know Rules, Formulas, Standards

1. The "Only One" Rule
2. If an item can only go in one container, lock it in immediately.

3. Example: "The green ball is in Box 2."-Green ball = Box 2 (no other options).

4. The "Chain Reaction" Rule

5. One locked assignment can force others.

6. Example: If Box 1 has Item A, and "Item A cannot be next to Item B", then Item B cannot be in Box 2.

7. The "Time Block" Rule (for scheduling)

8. If Task X takes 2 hours and must finish by 5 PM, it cannot start after 3 PM.
9. Formula: Latest Start Time = Deadline - Duration.

Worked Examples (Step-by-Step)

Example 1 (Easy): Basic Box Assignment

Question: Three boxes (A, B, C) contain one ball each: red, blue, green. - The red ball is not in Box A. - The blue ball is in a box with a higher letter than the green ball.

Which box contains the red ball?

Solution:
1. List constraints: - Red-A. - Blue > Green (in box letters: A < B < C).

1. Eliminate options:
2. If Green = A, then Blue must be B or C (valid).
3. If Green = B, then Blue must be C (valid).

4. If Green = C, Blue has no higher box (invalid).

5. Test possibilities:

6. Case 1: Green = A-Blue = B or C.
   • Red cannot be A (given), so Red = C (if Blue = B) or Red = B (if Blue = C).
   • But if Blue = C, Red cannot be B (because Blue > Green = A, but Red-A, so Red must be B or C—but C is taken by Blue). Contradiction.
   • Valid: Green = A, Blue = B, Red = C.

7. Case 2: Green = B-Blue = C.

   • Red-A, so Red must be B—but B is Green. Contradiction.

8. Conclusion: Only Case 1 works.

9. Answer: Box C contains the red ball.

Example 2 (Medium): Scheduling with Precedence

Question: Four tasks (W, X, Y, Z) must be scheduled in 4 time slots (1–4). - W must start before X. - Y must start immediately after X. - Z cannot start in Slot 1.

What is the earliest possible start time for Z?

Solution:
1. Draw a timeline: Slot 1 | Slot 2 | Slot 3 | Slot 4

1. Apply constraints:
2. W-X (W must come before X).
3. X-Y (Y must follow X immediately).

4. Z-Slot 1.

5. Test arrangements:

6. Option 1: W in 1, X in 2, Y in 3-Z must be in 4 (valid).
7. Option 2: W in 1, X in 3, Y in 4-Z must be in 2 (but Z-1, so valid).

8. Option 3: W in 2, X in 3, Y in 4-Z must be in 1 (invalid, Z-1).

9. Earliest Z:

10. In Option 2, Z is in Slot 2.
11. Answer: Slot 2.

Example 3 (Hard): Multiple Constraints

Question: Five people (A, B, C, D, E) sit in a row of 5 chairs. - A is not next to B. - C is immediately to the left of D. - E is in the first or last chair. - B is in a higher-numbered chair than A.

Who is in Chair 3?

Solution:
1. List constraints: - A-next to B. - C-D (C immediately left of D). - E = 1 or 5. - B > A (chair numbers).

1. Eliminate impossible options:
2. If E = 1, then chairs 2–5 are A, B, C, D.
3. C-D must be adjacent (e.g., 2-3, 3-4, 4-5).

4. B > A, so A cannot be in 5.

5. Test E = 1:

6. Option 1: C-D in 2-3-A and B in 4-5.
   • B > A-A=4, B=5.
   • Check A-next to B: 4 and 5 are next to each other. Invalid.

7. Option 2: C-D in 3-4-A and B in 2 and 5.

   • B > A-A=2, B=5.
   • Check A-next to B: 2 and 5 are not adjacent. Valid.
   • Chair 3 = C.

8. Test E = 5:

9. C-D must be in 1-2, 2-3, or 3-4.
10. If C-D in 3-4, then A and B in 1-2.
    • B > A-A=1, B=2.
    • But E=5, so A=1 is possible.
    • Check A-next to B: 1 and 2 are adjacent. Invalid.

11. Other options also fail.

12. Conclusion:

13. Only E=1, C-D in 3-4, A=2, B=5 works.
14. Answer: Chair 3 = C.

Common Exam Traps & Mistakes

Shortcut Strategies & Exam Hacks

1. The "Anchor" Technique
2. Find a fixed pair (e.g., "C is left of D") and build around it.

3. Example: If C-D must be adjacent, test all possible positions for them first.

4. The "Process of Elimination" (POE) Grid

5. Draw a table and cross out impossible options immediately.

6. Example: | | Box 1 | Box 2 | Box 3 | |-------|-------|-------|-------| | Red |- |- |- | | Blue |- |- |- |

7. The "Time Block" Shortcut (for scheduling)

8. If a task must finish by 5 PM and takes 2 hours, it cannot start after 3 PM.

9. Formula: Latest Start = Deadline - Duration.

10. The "Adjacency Trick"

11. If two items must be next to each other, treat them as a single unit when counting slots.

12. Example: C-D in 5 chairs-4 possible positions (1-2, 2-3, 3-4, 4-5).

13. The "Negative Clue" Hack

14. "Box 3 does not contain the key"-The key must be in Box 1 or 2.
15. Use this to eliminate other options.

Question-Type Taxonomy

Practice Set (MCQs)

Question 1

Three boxes (X, Y, Z) contain one fruit each: apple, banana, cherry. - The apple is not in Box X. - The banana is in a box with a letter that comes after the cherry’s box.

Which box contains the banana? A) X B) Y C) Z D) Cannot be determined

Correct Answer: C) Z Explanation: - Apple-X-Apple is in Y or Z. - Banana > Cherry (in box letters: X < Y < Z). - If Cherry = X, Banana = Y or Z. - If Cherry = Y, Banana = Z. - Cherry cannot be Z (no higher box for banana). - Test Cherry = X: - Banana = Y or Z. - Apple-X-Apple = Y or Z. - If Banana = Y, Apple = Z (valid). - If Banana = Z, Apple = Y (valid). - Test Cherry = Y: - Banana = Z. - Apple-X-Apple = Y (but Y is Cherry). Invalid. - Only Cherry = X, Banana = Z works. Why Distractors Are Tempting: - A) X: Violates "banana > cherry." - B) Y: Works if cherry = X, but not the only option. - D) Cannot be determined: The constraints do determine the answer.

Question 2

Four tasks (P, Q, R, S) must be scheduled in 4 time slots (1–4). - P must start before Q. - R must start immediately after Q. - S cannot start in Slot 1.

Which task must be in Slot 3? A) P B) Q C) R D) S

Correct Answer: C) R Explanation: - P-Q-R (P before Q, R after Q). - S-1. - Possible orders: - P, Q, R, S - S, P, Q, R - In both cases, R is in Slot 3. Why Distractors Are Tempting: - A) P: Could be in Slot 1 or 2. - B) Q: Could be in Slot 2 or 3. - D) S: Could be in Slot 1 (invalid) or 4.

Question 3

Five people (A, B, C, D, E) sit in a row. - A is not next to B. - C is immediately to the left of D. - E is at one end. - B sits to the right of A.

Who is in the third seat? A) A B) B C) C D) D

Correct Answer: C) C Explanation: - C-D must be adjacent (e.g., 1-2, 2-3, 3-4, 4-5). - E = 1 or 5. - B > A (seat numbers). - Test E = 1: - C-D in 2-3-A and B in 4-5. - B > A-A=4, B=5. - Check A-next to B: 4 and 5 are adjacent. Invalid. - C-D in 3-4-A and B in 2 and 5. - B > A-A=2, B=5. - Check A-next to B: 2 and 5 are not adjacent. Valid. - Seat 3 = C. Why Distractors Are Tempting: - A) A: Could be in 2 or 4, but not 3. - B) B: Never in 3 in valid arrangements. - D) D: Always to the right of C, so if C=3, D=4.

Question 4

Three boxes (1, 2, 3) contain one animal each: cat, dog, rabbit. - The dog is in a box with a higher number than the cat. - The rabbit is not in Box 2.

Which box contains the rabbit? A) 1 B) 2 C) 3 D) Cannot be determined

Correct Answer: A) 1 Explanation: - Dog > Cat (box numbers). - Rabbit-2. - Possible arrangements: - Cat=1, Dog=2, Rabbit=3 (but Rabbit-2, so valid). - Cat=1, Dog=3, Rabbit=2 (invalid, Rabbit-2). - Cat=2, Dog=3, Rabbit=1 (valid). - In both valid cases, Rabbit is in Box 1. Why Distractors Are Tempting: - B) 2: Directly violates the rabbit constraint. - C) 3: Possible, but not the only option. - D) Cannot be determined: The constraints do determine the answer.

Question 5

Four meetings (M, N, O, P) must be scheduled in 4 time slots (9 AM–12 PM). - M must start before N. - O must start at 10 AM. - P cannot start at 12 PM.

Which meeting must start at 11 AM? A) M B) N C) O D) P

Correct Answer: B) N Explanation: - O = 10 AM (fixed). - M-N (M before N). - P-12 PM. - Possible slots: - 9 AM: M or P - 10 AM: O - 11 AM: M or N - 12 PM: N or P (but P-12 PM) - If M=9 AM, N must be 11 AM or 12 PM (but P cannot be 12 PM, so N=11 AM). - If P=9 AM, M must be 11 AM, N=12 PM (but P-12 PM, so invalid). - N must be at 11 AM. Why Distractors Are Tempting: - A) M: Could be 9 AM or 11 AM. - C) O: Fixed at 10 AM. - D) P: Could be 9 AM or 11 AM.

30-Second Cheat Sheet

1. Constraints are absolute—never violate them.
2. Process of elimination (POE) first, then fill gaps.
3. Anchor clues (e.g., "C is left of D") are your starting point.
4. Negative info is gold—cross out impossible options immediately.
5. Precedence = timeline—draw it out.
6. Adjacent items = single unit (e.g., C-D counts as one "block").
7. If stuck, test the extremes (e.g., "What if X is first?").

Learning Path

1. Day 1 (0–12 hours): Foundation
2. Learn the core concepts (constraints, POE, adjacency).
3. Work through Example 1 (Easy) 5 times until it’s automatic.

4. Memorize the 30-Second Cheat Sheet.

5. Day 1 (12–24 hours): Core Rules

6. Study the Rule-Book and Must-Know Rules.
7. Solve Example 2 (Medium) without looking at the solution.

8. Practice 5 POE grids on paper.

9. Day 2 (24–36 hours): Application

10. Tackle Example 3 (Hard) and the Practice Set MCQs.
11. Time yourself: 2 minutes per question.

12. Review Common Exam Traps and Shortcut Strategies.

13. Day 2 (36–48 hours): Timed Drills

14. Do 10 mixed questions (mix of box and scheduling puzzles).
15. Aim for 80% accuracy in 15 minutes.

16. Revisit Question-Type Taxonomy to recognize patterns.

17. Final Hour: Mock Test

18. Simulate exam conditions: 5 questions in 10 minutes.
19. Focus on speed + accuracy—skip and return if stuck.

Related Topics

1. Logical Deduction (LSAT/GRE)
2. Overlaps with box puzzles; uses similar POE techniques.
3. Constraint Satisfaction Problems (Coding Interviews)
4. Box puzzles are a simplified version of CSPs (e.g., Sudoku solvers).
5. Critical Path Method (PMP/CFA)
6. Scheduling puzzles train you to handle task dependencies.