You skipped the game, so here is just the optimal path. Is this what you would’ve done?
A few weeks ago, 30,954 people mowed the same lawn. This is what their paths looked like.
Many came close to the optimal path. 52% of people came within five moves of the best possible path, and 16% did it perfectly.
Many different approaches, yet similar, pretty good outcomes. Only 49 squares need to be covered, but people found 14,589 different ways to do it. Despite all that variety, the median person still hit 91% efficiency (within 5 moves).
For this small lawn, there are 12 different perfect solutions and people found them all.
But what were you actually solving?
Finding the best path through the squares is a classic computer science problem. No, don’t leave! We promise this won’t get too wonky.
Path planning problems
Solving the lawn mowing problem is formally called Coverage Path Planning, and is related to one of the most famous path planning problems in computer science: The Traveling Salesman Problem.
The premise is simple: a salesman must visit a set of cities exactly once and return to their starting point, all while taking the shortest possible route. A pizza delivery driver planning their stops or a trick-or-treater maximizing their candy haul is solving a version of this problem.
We wanted to create this mowing experiment after we read a study that found humans come impressively close to computer-calculated optimal solutions to this problem with fewer stops, and even do pretty good — just 11% less efficient than optimal — for 70+ stops. We recreated their chart below. As the stops increase, humans’ ability decreases. Would results be similar for mowing a lawn?
A slight detour, if we may. There are two main ways to tackle a problem like this. Simplifying things a bit, there are algorithms which guarantee the optimal path, and heuristics which use shortcuts to find a “good enough” path, fast.
Why do people need heuristics? If a salesperson had to visit just 10 cities and every possible route has to be checked, we’d surprisingly need to test 3.6 million of them. That number explodes exponentially as more cities are added.
15 cities and we’re at 1.3 trillion possible routes. 😱
20 cities balloons to 2.4 quintillion possible routes. 🤯
When problems are small, the approach doesn’t matter much, almost everything works. But as complexity grows, optimal becomes impossible and heuristics become necessary. This is true for both humans and computers. People both fall back on good-enough strategies when perfect is impractical.
A guided tour
Let’s replay a mowing session, director’s-cut style, with some commentary along the way. For this walkthrough, we’ll use a perfectly average run from a person who called themselves Bones. It took them 54 moves–five more than optimal. We recorded the timestamp of each move, so every hesitation or direction change left a data footprint.
We’ll rewind to the start and walk through it. Before Bones even made a move, they paused for 2.9 seconds. They were perfectly average here as well. Upon seeing the lawn revealed, they naturally paused to survey the lawn and, perhaps, made a plan.
Off went Bones! There was nothing to decide in the opening stretch until the fifth square. Continue right, or go down?
This is where paths first diverged. Bones barely hesitated (0.7s) and decided to go down, like 20% of other people. This is a critical moment that we’ll come back to shortly.
Bones plodded along the outside edge until they reached the bottom. Their first notable pause (2.4s) came when they realized they hit a dead end and had to retrace their steps.
After realizing their mistake, Bones turned around and re-mowed their first square to finish this section. To get to the other open section they had to backtrack through two more squares. Then it was mostly smooth sailing as they worked around the edges, then filled in the remaining squares in the middle.
What differentiated the best mowers from everyone else came down to a single critical decision. We can divide the lawn into two main sections: left and right. Bones completed the left section first. Because it dead-ends, the only path out was to retrace their steps, creating an inevitable backtrack.
If we look at where each person ended, we can see this play out. People three or more moves from optimal finished scattered across the lawn.
While those within two moves of optimal, including the 17% who were perfect, chose to mow the right side first so they could end their run on the left, having anticipated the dead-end trap.
One of those was a person whose real name was Sarah. We got in touch, and learned that she finished on the left intentionally.
“I saw the dead end at the end and I was like, okay, that’s where I need to end as well, so don’t go that way first.”
Sarah knew a dead end meant the left section had to be reserved for the end to avoid backtracking. The pause data backed her up. Her longest hesitation came a square before the fork, before continuing to clear the right side.
Sarah also did something that appeared a bit unnatural. Instead of simply continuing straight a few times, she intuitively and preemptively turned in a snake-like pattern. This highlighted a key difference between real-life mowing and our simplified game, an approach that strong mowers exploited. Sarah, an avid gamer, seemed to recognize this strategy immediately.
Six lawns
That was one lawn. We built five levels, each bigger and more cluttered than the last, up to a 14x14 lawn with almost 200 squares to cover.
30,954 people made it through two required levels, and 8,912 people completed a few extra bonus ones. The green lines show the median optimality for each lawn. The light band represents how most people (80%) did.
We expected a decline. The Traveling Salesman Problem research suggests that people do worse as the problem grows. But optimality held around 90% whether the lawn took 26 moves or 177.
One caveat: we made the lawns bigger with different obstacle layouts at the same time, so we can’t say which mattered more. Performance was actually slightly better on the largest lawn than the previous two, which suggests that layout matters more than raw size.
Our best guess is the structure of a lawn itself. Where the Traveling Salesman Problem scatters nodes randomly, a lawn has structure, which lets people fall back on two strategies: decomposition and compression.
People decomposed the lawn into smaller, more manageable sections and solved them incrementally. Our interviewee Sarah described this perfectly.
“I take it piece by piece...I try to leave everything behind me finished.”
On the biggest lawn, she was explicit about why: holding the whole thing in her head wasn’t an option.
“I’m not going to be able to plan all of this out...just even trying to remember all of it would be way too challenging.”
So she chunked things up. She cleared a section and moved on to the next. Textbook decomposition.
As people moved between rounds, they may have compressed what they learned into a mental model of the game, allowing them to identify patterns in more complex lawns and adapt their gameplay.
When you think
It seemed obvious to us that people who thought longer would mow better. Below, the 7,235 people who finished every lawn, plotted by pace (seconds spent per square, which normalizes time across lawn sizes) against how close to optimal they got. Pick any pace percentile on the x-axis and the spread of results looks about the same as at any other.
While there is a very small trend on the opposite ends for the top and worst mowers, if we told you how long someone took, you couldn’t guess how well they did. Technically speaking, time alone explains less than 5% of the variation in how people did (R2 of 4.9%).
We isolated just extended pause times (i.e., thinking) and the same trend held, but where they paused is a different story. Let’s take a look at level four as an example.
Top 10% — seconds paused per square
Bottom 10% — seconds paused per square
The best mowers (90th percentile) spent time thinking early as they traveled down the first column, then thought more at the juncture between the two rock clusters on the bottom left: go toward the cluttered middle section, or clear the open space to the right first. They were able to intuit that they should finish in the dead-end pocket at the top in order to minimize backtracking. As a result, they didn’t need to pause once they reached the home stretch.
Meanwhile, the worst mowers (10th percentile) sped through the beginning and barely paused to think until a corner or edge forced them to, implying reacting, not planning. They only realized that the same pocket was a dead end once they were already in it, then had to stop, backtrack, and work out where to go from there.
The best mowers moved at about the same speed as everyone else, but they revisited far fewer squares. They spent their time at the forks and cruised through the rest. Below are two people who finished at the exact same time with different results.
We heard this in the interview too. Sarah, one of the best mowers, spent her attention unevenly on purpose. She had a theory about why.
“The bigger spaces have more cognitive load for you to figure out what the best path is. Whereas the smaller spaces...there are fewer decisions to make.”
She planned the tight, trap-prone sections carefully and winged it on the open ones.
So it’s not about thinking more or faster, but when thinking happens. That’s what a good heuristic does: it spends your attention on the decisions that matter and nothing on the ones that don’t.
Good luck not thinking about this the next time you mow a lawn!
Explore
Below is a little playground. Pick a lawn and mow it, or explore where people paused, backtracked, and finished.
move: 1
use the arrow keys to move
Data and Methods
Data is a snapshot of the live experiment as of July 31, 2026. There was a pause in the experiment after the second level to collect demographic information. Later levels were optional and presented as bonus rounds, so fewer people played them.
The scatterplot chart from the Traveling Salesman study is approximated based on the image in the study since data weren’t provided.
Pace is seconds per required square, not per square someone actually mowed. If we divided by their real move count, a longer path would both hurt their optimality and inflate their move count, which would make the comparison circular.
To find optimal efficiency, we ran algorithms that solved each lawn exhaustively. The optimal solution included backtracks on some levels.
The 4.8% R2 value comes from a linear fit of pace percentile against optimality percentile among people who finished every lawn.
We interviewed one participant, Sarah, over video after she gave permission to use her real name. Everyone else is referred to by the nickname they entered during the game.
You can explore the raw user data on our Github.