Level Atlas

Counter-Strike

de_dust2draft

The most played competitive map in shooter history and the reference implementation of three-lane design. Its lanes, chokes, and callout landmarks became a shared language that later maps are still measured against.

Year
2001
Platform
PC
Genre
Competitive first-person shooter
Layout
open
Engine
GoldSrc
Designers
David Johnston

Layout notes

Three lanes connect the two spawns: A long, mid, and B tunnels. Mid functions as a pivot that connects to both sites, so taking it converts a lane commitment into a rotation option. Progression here means round time rather than physical distance.

Intensity curve

00.510% through, demand 15%: Buy and setup10% through, demand 30%20% through, demand 55%: First contact at mid32% through, demand 40%45% through, demand 60%55% through, demand 75%: Site execute65% through, demand 50%75% through, demand 65%: Plant85% through, demand 85%: Retake100% through, demand 30%Buy and setupFirst contact at midSite executePlantRetakestartend
Demand on the player (combat pressure, platforming difficulty, disorientation), not fun. Relative within this level only.

Space graph

The level as places and the connections between them. Left to right reads as progression, top to bottom as elevation. Dashed outlines are optional spaces; select any space or callout to read it.

T spawn path Long AT spawn path MidT spawn path B tunnelsLong A path A siteMid path CatwalkCatwalk path A siteMid path Lower tunnels. The rotation that makes mid worth contesting: control here threatens both sites.Lower tunnels path B siteB tunnels path B siteCT spawn path CatwalkCT spawn path B siteCORRIDORLong ALong A: corridor, critical pathEXITA siteA site: exit, critical path. An objective rather than a way out, but structurally it is where the round resolves.ENTRYT spawnT spawn: entry, critical pathHUBMidMid: hub, critical pathCORRIDORCatwalkCatwalk: corridor, critical pathENTRYCT spawnCT spawn: entry, critical path. The second entry. A competitive map is authored from both ends at once, which is what the two-entry graph makes visible.CORRIDORB tunnelsB tunnels: corridor, critical pathEXITB siteB site: exit, critical pathCORRIDORLower tunnelsLower tunnels: corridor, critical pathCritical path: Long ACritical path: MidEncounter: Double doorsCritical path: B tunnelsEncounter: B site
PathOptional space

Select a space, a connection, or a callout to read it. 9 spaces, 11 connections, 5 callouts on this level.

Read the graph as a list

Spaces

  • Long A corridor, critical
  • A site exit, critical
  • T spawn entry, critical
  • Mid hub, critical
  • Catwalk corridor, critical
  • CT spawn entry, critical
  • B tunnels corridor, critical
  • B site exit, critical
  • Lower tunnels corridor, critical

Connections

  • T spawnLong A path
  • T spawnMid path
  • T spawnB tunnels path
  • Long AA site path
  • MidCatwalk path
  • CatwalkA site path
  • MidLower tunnels path
  • Lower tunnelsB site path
  • B tunnelsB site path
  • CT spawnCatwalk path
  • CT spawnB site path

Techniques

  • Chokepoint balancetopology

    Each site has two attacker entrances and defensible angles, and mid gives attackers a rotation option that stops either lane from being a coin flip.

  • Sightline controlguidance

    Long A rewards patience and rifles, tunnels reward pace and utility. The map's identity comes from lanes that ask different questions.

  • Multi-route paritytopology

    All three lanes are viable openers with distinct risk profiles, so team strategy is a genuine choice rather than a solved default.

  • Weenieguidance

    Double doors, the car, catwalk, and goose are visually distinct enough to serve as callouts, which is a navigation feature disguised as decoration.

Notes

The graph reads oddly here on purpose: two entries and no single spine, because a competitive map is authored from both ends and has no player-facing direction. Dust2 is also the best test case for the intensity curve reading round time rather than physical progression; consider a distinct curve mode for multiplayer maps.

Sources

  • articleDavid Johnston's writing on designing de_dust2