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 don't know whether it's possible to guarantee an efficient method for solving every possible puzzle in the broad family of constraint satisfaction problems.

open Global / Unspecified, Global

Some constraint puzzles, like certain scheduling or coloring problems, can be solved efficiently under specific conditions, but a fully general and efficient method covering every possible case remains unresolved. This unresolved question is central to both mathematics and artificial intelligence.

possible efficient method every constraint mathematics-logic

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

Citation ID: WS01329 Title: We don't know whether it's possible to guarantee an efficient method for solving every possible puzzle in the broad family of constraint satisfaction problems. URL: https://worldsolve.org/index.php?api=problem&id=1329