Counting hidden cubes in an isometric pile comes down to one rule: every occupied lattice coordinate inside a supported column counts as exactly one cube, even when no face is drawn on screen. A "count the cubes game" built on isometric voxel art tests that idea directly, because the visible drawing is only the surface of a three-dimensional structure, and a tall column can contribute just one top diamond while still holding several stacked cubes that never become visible. The Counting Blocks Puzzle turns this into a five-round challenge where you read an isometric pile, open a layer scanner, count the filled cells across every z level, and pick one of four totals. Each exact selection is worth 200 points, so five correct totals produce the maximum 1,000-point run. Anything less produces fewer points, makes the run fragile to a second wrong pick, and never relies on a stored answer field, hidden label, or visible count: the right total is derived from the literal voxel list every time you play.
What "Count the Cubes Game" Actually Asks You to Do
Players usually arrive at a count the cubes game expecting a quick visual tally: count the polygons, pick the number, move on. The Counting Blocks Puzzle looks similar at first glance, but each round hides a structural problem under the surface. You see one isometric pile drawn with transparent geometry, four totals listed beneath the scene, and a layer scanner that opens when you need it. Your job is to decide which of those four totals matches the actual lattice, the full three-dimensional count of unit cubes, not the count of top diamonds, not the count of colored side panels, not the count of visible outlines.
The voxel sets themselves sit on an integer lattice, and every cube is written as (x, y, z). The x and y values locate the column on the floor, while z gives the height. A hard rule applies to every pile: any coordinate above z zero has the coordinate directly below it, so the structures never contain floating cubes. That rule is what makes the layer scanner reliable, because filled cells stack vertically and a tall column really does hold multiple cubes whether or not the top is visible from the chosen camera direction.
Why Visible Faces Lie About the True Cube Count
The isometric drawing only shows the outer shell of a pile. The renderer walks every cube and checks three neighboring positions in the positive x, positive y, and positive z directions, the camera-facing sides. A top face polygon appears only when the coordinate directly above is empty, one side face appears when the positive x neighbor is empty, and the other side face appears when the positive y neighbor is empty. As soon as at least one of those three directions is open, the cube contributes at least one visible polygon. Drawing nothing at all requires all three of those directions to be occupied, and only then does the cube vanish from the rendered surface.
The constants that produce the drawing are screen x equals 150 plus 30 times (x minus y), and screen y equals 80 plus 17 times (x plus y) minus 34 times z. Those are pure projection numbers and they never alter the cube count. The transparency rule, not the projection constants, is the reason visible polygons undersell the true total. A player who counts faces ends up short. A player who reads the layer scanner ends up accurate. The relationship between visible faces and actual cube count is summarized below.
| What the drawing shows | Visible polygons | Actual cubes involved |
|---|---|---|
| Top diamond of a column | 1 | Every cube in that (x,y) column, even when no side faces remain |
| Top plus both side faces | 3 | At least the cube on top; neighbor columns may add more |
| Only one side face | 1 | Still exactly one cube, but the top and the other side are covered |
| No polygon at all | 0 | Exactly one fully hidden cube that still occupies the lattice |
The Hidden-Cube Rule That Changes Every Answer
The independence test for the engine deliberately includes counterexamples for one, two, and three neighbors, so a small rule change cannot quietly classify every covered side as a fully hidden block. One neighboring cube is not enough to hide an entire cube, and two neighbors are not enough either, because three directions are checked independently. If any of the three camera-facing directions is open, at least one face stays visible. Removing the cube from the surface requires three solid neighbors, and that is exactly the situation the layer scanner handles without ambiguity. The auditor also runs supported removed-voxel cases that can confuse a single projection, then exhaustively checks every supported column-height combination permitted by each public footprint and height range, so every pile in the game has a single derivable answer rather than a stored one.
How to Use the Layer Scanner to Count Every Block
- Study the isometric pile to understand its overall shape and confirm the camera direction, then open the layer scanner beneath the pile.
- Read the z layers from the bottom up. Each filled scanner cell marks one occupied (x, y) coordinate at that level, including cubes that draw no face in the isometric view.
- For every layer, count the filled cells and add them to a running total. Empty cells exist only to preserve footprint alignment and contribute nothing to the cube count.
- Read off the final sum, which is the total number of occupied lattice coordinates in the pile. Compare it against the four totals listed beneath the pile and pick the matching option.
- Each exact pick awards 200 points and immediately presents the next pile. Five correct piles in a row finish the run at the maximum 1,000 points.
Scoring, Repair, and the Path to 1,000 Points
The interface exposes no total field, no visible count, no hidden count, no solution label, and no result data attribute before you commit to a guess, so there is nothing to peek at and no clue to read off the answer buttons. The right total is recomputed independently from the literal voxel coordinates each round, which is why the same answer stays correct if you restart. After one wrong pick, your run stays alive: selecting the same incorrect option again is deduplicated and does not consume a second miss. Correcting the round clears its failure history, so an old mistake from an earlier round never contaminates a later scene. A second genuinely different wrong total locks the run.
Restart always reconstructs the exact opening state, so a deadlocked run can be replayed from the first pile without contamination. Pointer and touch input use native answer buttons with targets taller than 44 pixels, and keyboard play begins by focusing an option. Arrow keys move through the two-by-two option grid while the real DOM focus follows the visible cursor, and Enter or Space chooses the current cursor through a functional update, avoiding a stale answer after fast navigation. Mouse clicks and touch taps choose the button directly, and completion or deadlock disable every answer while Restart remains available through the shared game shell.
Five Original Rounds, Five Different Pile Shapes
The five scenes in the Counting Blocks Puzzle progress from a compact two-by-two platform through a raised ridge, a crowned footprint, diagonal towers, and a broad hidden terrace. Their derived totals are not stored in named answer fields; the four options are plain numbers, and the engine independently counts the literal voxel list to find the single matching option. Coverage varies across the rounds: a flat platform hides very little, a raised ridge forces a partial top step to be reconstructed, a crowned footprint buries interior cubes under a perimeter cap, diagonal towers test whether you read the layer scanner column by column. Together the five voxel sets, the option values, the projection constants, the scoring, and the failure behavior are original product fixtures with no claim about physical perspective, architectural volume, or any diagnostic ability beyond the abstract lattice rule system.
Related Spatial Counting Puzzles
Spatial reasoning carries over to several other browser puzzles. The Painted Cube Puzzle works through the same integer lattice from the other direction, asking which face positions a sliced cube passes through. The Spatial Memory Game adds a rotation step on top of the coordinate system. The Cube Net Puzzle stays in two dimensions and asks which six-square patterns fold into a cube, while the Block Stacking Puzzle reverses the problem by handing you pieces and asking which filled cells must result.
For the actual five-round isometric counting task, the Counting Blocks Puzzle is the dedicated tool: it rebuilds vertical columns, counts cubes hidden behind visible faces, and turns the difference into a deterministic 1,000-point finish that runs entirely in your browser.