World Cup camera coverage poses a moving math puzzle

A World Cup match may look chaotic, but the camera grid behind it is a carefully engineered attempt to keep every tackle and flash of contact within view. The problem becomes a genuine mathematics challenge when 22 moving players constantly block one another—a

By the time the ball is crossed into the box this summer, the argument will already be forming—somewhere between the crowd and the referee’s headset.

“That was a bad call!” someone will shout. “That wasn’t a foul!” another will fire back. And if video replay is involved, the debate won’t stop there. Fans will use replays to validate or refute decisions, then fight about what the cameras actually captured and from where.

But behind those heated moments sits a quieter question—one that sounds harmless until you try to answer it precisely: how many cameras are needed, at minimum, to cover a playing field as accurately as possible, and where should they be placed so that every action is recorded?

That question quickly stops being intuitive.

In mathematics, it echoes a well-known geometry puzzle: the “art gallery problem.” In 1973, mathematician Václav Chvátal asked his colleague Victor Klee for a geometry challenge. Klee’s reply framed it like a museum: how many guards are needed, at a minimum, to protect a gallery.

The problem is an optimization exercise that changes with the shape of the space. For a rectangular room with pictures hanging on the walls—assuming there are no columns or people to block a guard’s view—one guard can be sufficient. The guard can stand in a corner and oversee the entire area.

As soon as the space becomes more complex, the simplicity disappears. In 1975, Chvátal published a paper proving that the minimum number of guards in a room with n corners is at most n⁄3 (rounded down if the result is not an integer).

To understand that reasoning, imagine the space divided into triangles. Each triangle’s endpoints match vertices—or corners—of the area. A guard can fully survey a given triangle. Then color the points on each triangle with three colors—red. blue. and green—so that adjacent points never share a color. Place guards at each point corresponding to one color, such as blue. With n vertices colored using three colors, at most n/3 guards are needed.

Still, that line of thinking is not the last word. Finding the smallest number of guards for arbitrarily shaped rooms, and deciding how to place them, proves notoriously difficult. Computers can hit their limits. Experts refer to it as a nondeterministic polynomial-complete (NP-complete) problem.

A soccer field, at least on the surface, looks simpler. It’s essentially a rectangle. A camera placed in one corner should, in theory, cover the whole field if its viewing angle is at least 90 degrees.

But a live match is not an empty room. Filming a blank pitch is pointless. What matters is a game where up to 22 players move and fight for the ball. During play, those moving players constantly obscure one another.

So the puzzle changes shape again.

Start with a static scenario. Suppose all 22 players are motionless across the field. In math terms, that’s like a museum guard setup with 22 holes—areas where our guard or video camera cannot see.

In 2009. mathematicians Hemanshu Kaul and YoungJu Jo—both then at the Illinois Institute of Technology—proved that 10 guards or cameras would suffice in this case. Their proof divided the area into polygons rather than triangles. built a network of points and lines from those polygons. and then determined how best to color the points of that network.

Yet even that result is conditional. It shows one solution that guarantees coverage, not necessarily the optimal arrangement. Fewer guards might still be enough.

The match is harder still once motion enters the picture.

With 22 holes—or players—moving around, a camera’s job becomes more than a flat geometry exercise. A significant part of a soccer match has a three-dimensional component; it’s not only about the ball and feet on the ground. Cameras also have practical limitations: they don’t cover a 360-degree field of view. unlike the idealized assumptions sometimes used in museum-guard style models.

Those factors complicate the problem to the point where computer-aided analyses become the only route to results in specific cases. Even then. simulations and tailored approximations do not produce a general. definitive statement that at least y cameras are needed at specific locations for perfect game monitoring.

But soccer broadcasting comes with something math papers can’t fully substitute: decades of filmed experience. Matches have been filmed and broadcast for a long time, and that history helps organizers choose where cameras go.

At the previous World Cup in Qatar, FIFA focused 42 cameras on the 22 players on the football pitch. The lineup included eight superslow-motion cameras and four ultraslow-motion cameras.

FIFA does not provide a precise explanation for why it uses so many cameras. The number seems high, but it is likely meant to ensure the entire pitch is covered as comprehensively as possible. With the resources it has. FIFA probably does not need to search for the smallest possible number of cameras in pursuit of an “optimal” mathematical solution.

Even so, the placement is revealing. Most of the cameras are located near each goal and at the halfway line—positions where the most exciting moments are likely to occur most frequently.

For smaller clubs and organizations, the challenge looks different and more unforgiving. Their equipment still needs to be properly calibrated and aligned to deliver reliable video evidence, and that’s not always easy.

So when spectators this year grow irate about video evidence—when they insist a replay proves something or someone wrong—the anger is understandable. It’s also potentially misdirected. Behind the replay button is an old problem with a stubborn answer: coverage that sounds straightforward only works until the field fills with moving bodies and every camera angle becomes a gamble.

World Cup FIFA video replay cameras sports technology art gallery problem computational geometry NP-complete Hemanshu Kaul YoungJu Jo Chvátal Klee camera placement