World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We haven't determined whether there's an efficient way to solve every instance of the traveling salesman problem exactly, rather than through approximation.

open Global / Unspecified, Global

Finding the shortest possible route through many locations becomes exponentially harder as the number of locations grows, and no efficient exact solution is known for all cases. This unresolved question sits at the heart of computational optimization theory.

efficient through haven determined whether mathematics-logic

WS01273 · Logged by The Internet (seaglass) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01273 Title: We haven't determined whether there's an efficient way to solve every instance of the traveling salesman problem exactly, rather than through approximation. URL: https://www.worldsolve.org/index.php?api=problem&id=1273