Think of a cube as the most symmetrical solid object you can hold — six faces, twelve edges, eight corners, and every angle a perfect 90 degrees. In AFCAT's Military Aptitude section, cube and dice questions test your ability to reason about three-dimensional space without physically rotating the object in your hands. That is the core skill being tested: spatial visualization under time pressure.
There are two major question families here, and they behave very differently.
Family 1: Painted and Cut Cubes. A large cube is painted on its external faces, then sliced into smaller equal cubes. The question asks how many small cubes have paint on exactly 0, 1, 2, or 3 faces. The insight is that the position of a small cube within the large cube entirely determines how many painted faces it has — corner cubes get three painted faces, edge cubes (not corners) get two, face-center cubes get one, and the interior cubes get none. These are not random — they follow a precise formula based on the number of cuts.
Family 2: Dice Problems. A die is a cube with numbers (or symbols) on its six faces. Standard dice have a specific convention: opposite faces sum to 7 (pairs: 1-6, 2-5, 3-4). Questions ask you to identify opposite faces, determine what you cannot see from a given viewpoint, or compute conditional probabilities when two dice are rolled.
The analogy that helps most students: imagine the large painted cube as a building. The corner flats have windows on three walls. The edge flats (not corners) have windows on two walls. The face-center flats have windows on one wall. The inner flats — deep in the building — have no windows at all. Once you internalize this building metaphor, the formulas fall into place naturally.
When a cube of side n units is cut into n³ smaller unit cubes, the count of small cubes by number of painted faces is:
| Paint Faces | Position | Count |
|---|---|---|
| 3 | Corners | 8 (always — every cube has exactly 8 corners) |
| 2 | Edges (non-corner) | 12 × (n − 2) |
| 1 | Face centers (non-edge) | 6 × (n − 2)² |
| 0 | Interior | (n − 2)³ |
Quick verification: 8 + 12(n−2) + 6(n−2)² + (n−2)³ = n³. This identity holds — it is just the expansion of n³.
Common values tabulated:
| n (cuts per edge) | n³ (total) | 3-face | 2-face | 1-face | 0-face |
|---|---|---|---|---|---|
| 3 | 27 | 8 | 12 | 6 | 1 |
| 4 | 64 | 8 | 24 | 24 | 8 |
| 5 | 125 | 8 | 36 | 54 | 27 |
| 6 | 216 | 8 | 48 | 96 | 64 |
Memorize this table. AFCAT uses n = 3, 4, 5, 6 almost exclusively. If the question says "cut into 64 smaller cubes," you immediately know n = 4 because 4³ = 64.
For a standard die:
A non-standard die (like the "magic cube" variant in some questions) will tell you the rule explicitly — for example, "opposite faces sum to 21." Apply the same logic: visible face x has an invisible opposite of (21 − x).
When AFCAT gives you conditional dice probability, use the restricted sample space method — do not compute from 36 outcomes and then divide. Directly enumerate the outcomes satisfying the condition, then find the favorable ones within that set.
Example: "At least one die shows 6" — the outcomes satisfying this condition are:
(1,6), (2,6), (3,6), (4,6), (5,6), (6,6), (6,1), (6,2), (6,3), (6,4), (6,5) — that is 11 outcomes. Notice (6,6) is listed once, not twice. Then check which of these 11 have sum greater than 8, and divide.
Conditional probability formula (when you need it):
But for AFCAT, enumeration is faster and more reliable than formula application — you will not miscalculate if you list the outcomes.
A net is a 2D unfolding of a cube's six faces. There are exactly 11 distinct valid nets. AFCAT sometimes asks whether two nets produce the same die (i.e., with the same face arrangement) or which face ends up opposite which face when folded.
The fastest method: use the cross pattern as your reference. In a cross-shaped net (one column of 4 with one face on each side of the second face from top), the top and bottom of the column of 4 are opposite each other. The two side wings are opposite each other. The remaining two (top of column and bottom of column extremes) are opposite the faces directly across the cross.
For AFCAT purposes, you rarely need to memorize all 11 nets. You need to be able to mentally fold the given net and decide which faces are adjacent versus opposite.
Whenever a painted-cube question appears, write: C=8, E=12(n−2), F=6(n−2)², I=(n−2)³ at the top of your scratch sheet. For n=4: C=8, E=24, F=24, I=8. For n=5: C=8, E=36, F=54, I=27. Pulling from a memorized table takes 5 seconds. Deriving from scratch takes 60–90 seconds. Savings: ~60s per question.
When the question gives total small cubes (e.g., 216), your first move is always the cube root: ∛216 = 6, so n=6. Write this as step zero before reading the rest of the question. This single step unlocks every subsequent calculation. Standard approach (reading first, trying to figure out n mid-calculation): ~25s of confusion. This approach: ~3s.
When the question says "given that..." or "at least one die shows...", do not start with 36 outcomes. Directly list only the outcomes satisfying the condition. Count them (call this D). Then find favorable outcomes within that list (call this N). Answer = N/D. This eliminates the division step and the error of double-counting outcomes like (6,6). Standard approach using P(A∩B)/P(B) from 36: ~45s. Direct enumeration: ~20s.
For any standard die, the moment you see a face, its opposite is (7 − that number). See 2? Opposite is 5. See 4? Opposite is 3. This is faster than recalling the pairs list. When the question uses a non-standard rule (e.g., opposite faces sum to 21), replace 7 with 21. Zero memorization required beyond the constant. Applying the rule: 2s per face vs. scanning a recalled list: 5–8s.
Cubes with zero paint are the inner core — peel off one layer from each side. The inner dimension is (n−2) per side. Interior count = (n−2)³. For n=5: inner core = 3×3×3 = 27. No formula memorization needed — just visualize removing one layer from all six sides and cube the remaining length. This works because peeling one layer on each of the two opposing sides reduces the edge by 2. Derivation time: 5s vs. formula recall: 15s when formula is half-remembered.
When you see a cube or dice question in the AFCAT hall, run this decision tree:
Step 1 — Identify the question type.
Step 2 — Painted Cube path:
Find n (cube root of total small cubes). Write CEFI values immediately. Match the question's "exactly X faces" to the correct row. Done.
Step 3 — Dice Face path: Apply the opposite-face rule (standard: sum to 7; non-standard: use the stated rule). If three faces are visible from a corner, compute each opposite. Sum if asked for a total.
Step 4 — Dice Probability path: List the restricted sample space first (outcomes satisfying the given condition). Count favorable outcomes within that space. Divide. Double-check that you haven't double-counted overlapping outcomes like (6,6).
Do not get distracted by the spatial language in the question — "from one corner," "from a particular viewpoint" — these are just telling you which three faces are visible. Once you know which faces are visible, the problem is pure arithmetic.
Why this question: The classic 2-face cut problem. Almost every AFCAT cycle has had this variant.
Solving path: 64 = 4³, so n = 4. Two-face cubes are on edges, not corners: count = 12 × (4−2) = 12 × 2 = 24. Answer: 24. Time: under 10 seconds once you have the table memorized.
Why this question: The 3-face (corner) question. Many students second-guess themselves and start deriving, wasting time.
Solving path: 216 = 6³, so n = 6. Three-face cubes are always at corners — and every cube, regardless of size, has exactly 8 corners. Answer: 8. This question is designed to make you overthink. The answer is always 8 for any n ≥ 2.
Why this question: Tests the conditional probability approach — a trap for students who start with "36 total outcomes."
Solving path: First die even = {2, 4, 6}, second die > 4 = {5, 6}. Restricted sample space = 3 × 2 = 6 outcomes: (2,5), (2,6), (4,5), (4,6), (6,5), (6,6). Sum = 9: only (4,5) qualifies (4+5=9). Probability = 1/6. Answer: 1/6.
Why this question: The 1-face (face-center) variant — a different formula from 2-face, and students confuse them.
Solving path: n = 4. One-face cubes = 6 × (4−2)² = 6 × 4 = 24. Each face of the large cube contributes (n−2)² = 4 face-center small cubes, and there are 6 faces. Answer: 24.
Why this question: Non-standard dice (opposite faces sum to 21). Tests whether you can adapt the standard rule.
Solving path: Visible faces: 8, 7, 12. Opposite faces: (21−8)=13, (21−7)=14, (21−12)=9. Sum of invisible = 13+14+9 = 36. Answer: 36.
Why this question: Conditional probability with "at least one showing 6" — the most common dice probability frame in AFCAT.
Solving path: At least one die shows 6: enumerate — (1,6),(2,6),(3,6),(4,6),(5,6),(6,6),(6,1),(6,2),(6,3),(6,4),(6,5) = 11 outcomes. Sum > 8: (3,6)=9, (4,6)=10, (5,6)=11, (6,6)=12, (6,3)=9, (6,4)=10, (6,5)=11 = 7 outcomes. Probability = 7/11. Answer: 7/11.
Why this question: Standard dice opposite-face identification — straightforward, but students overthink the "viewpoint" language.
Solving path: Opposite face to 3 = 7−3 = 4. The viewpoint information (visible faces 2, 3, 4) is a distractor — it does not change the answer. Standard opposite pairs: (1,6), (2,5), (3,4). Answer: 4.
Why this question: The 0-face (interior) variant — tests the (n−2)³ formula.
Solving path: 125 = 5³, so n = 5. Interior (unpainted) cubes = (5−2)³ = 3³ = 27. Visualize peeling one layer from each side — the inner block is 3×3×3. Answer: 27.
Forgetting that 3-face count is always 8. Students compute 12×(n−2) for 3-face cubes instead of recognizing it is always 8 — the number of corners. This is constant for all n ≥ 2.
Confusing the formulas for 1-face and 2-face cubes. Two-face formula is 12(n−2), one-face formula is 6(n−2)². The 12 and the 6 come from the number of edges (12) and faces (6) respectively. Swap them and you get the wrong answer every time.
Starting conditional probability from 36 outcomes. When the question gives a condition ("given that...", "at least one..."), you must work in the restricted sample space, not the full 36. Starting from 36 and dividing by P(B) is algebraically identical but far more error-prone under time pressure.
Double-counting (6,6) in "at least one 6" problems. If you list outcomes as "one die shows 6" and include (6,6) twice (once for each die), you inflate the denominator to 12 instead of 11. The outcome (6,6) is one outcome, full stop.
Applying the standard (sum = 7) rule to non-standard dice. When a question specifies "opposite faces sum to 21" or gives a different rule, the standard pairs (1-6, 2-5, 3-4) do not apply. Read the rule stated in the question.
Treating the "viewpoint" description as extra information that changes the opposite-face answer. In dice face questions, being told "you can see faces showing 2, 3, and 4 from a particular viewpoint" is just context — the opposite of 3 is still 4 regardless of what other faces happen to be visible. The viewpoint description only matters when you need to determine adjacency relationships, not opposite pairs in a standard die.