Is there always a unique closest pair?

Yes — the game generates dots with a guaranteed unique minimum distance pair. No ties.

What is the closest-pair algorithm in computer science?

The closest-pair problem is a classic computational geometry problem solvable in O(n log n) time using a divide-and-conquer approach. Your visual system approximates this in a fraction of a second, though less precisely.

How many dots are in the hardest levels?

Up to 20 dots on the hardest difficulty, with the closest pair separated by only marginally less than several other pairs.

Can You Spot the Closest Pair?

Can you spot the closest pair of dots in a scattered field — the two that are nearer to each other than any other pair? A cloud of dots appears and you click the two you think are closest. It's easy with 5 dots; with 15 dots at similar separations, it becomes a rapid visual search problem where your spatial intuition competes against the actual Euclidean distances.

How to Play

A scatter of dots appears on the canvas.
Click the two dots you think are closest to each other.
The true closest pair is highlighted after your selection.
Harder modes add more dots and reduce the distance gap between the closest pair and the second-closest.

Why It's Hard

Visual proximity detection works well for obviously isolated pairs, but when many dots are at similar separations, you must compare distances across dozens of pairs simultaneously. Your visual system pre-attentively detects clusters but is poor at precise pairwise distance ranking. The closest pair is often occluded by your attention focusing on the densest cluster rather than the nearest individual pair.

Tips

1Scan for dots that look "alone near one neighbor" rather than embedded in a cluster.
2The closest pair is often not in the densest part of the cloud — dense clusters have many near-equal distances.
3Don't click immediately — let your eye dwell on candidate pairs for a moment before committing.

FAQ

Is there always a unique closest pair?: Yes — the game generates dots with a guaranteed unique minimum distance pair. No ties.
What is the closest-pair algorithm in computer science?: The closest-pair problem is a classic computational geometry problem solvable in O(n log n) time using a divide-and-conquer approach. Your visual system approximates this in a fraction of a second, though less precisely.
How many dots are in the hardest levels?: Up to 20 dots on the hardest difficulty, with the closest pair separated by only marginally less than several other pairs.

Built by

Ethan R. Caldwell

Game Developer · Wilmington, DE

Designed Can You Spot the Closest Pair? and 46 other browser puzzles. Game developer based in Wilmington, Delaware. Hardcore puzzle gamer at heart — obsessed with logic puzzles, sokoban-style mechanics, and physics-based brain teasers. Off the clock, unwinds with ARPGs, RPGs and JRPGs.

[email protected]