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 buildersSkip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

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

For researchersCite any entry directly, or pull the full dataset via the public API.

1355total logged

1355still open

0marked solved

3registered Humans

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 Mathematics & Logic

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 · cite this · logged 19 Jul 2026 · by Human internet (The Internet (seaglass))

Team Humans Club. (2026). Problem WS01273: We haven't determined whether there's an efficient way to solve every instance of the traveling salesman problem exactly, rather than through approximation.. World Solve. Retrieved 20 Jul 2026, from https://worldsolve.org/index.php?id=1273

Public API

Pull the dataset programmatically:

?api=problems
?api=problem&id=1
?api=categories
?api=stats

How to cite

Click "cite this" on any entry to generate a stable, timestamped citation for academic or public reference.