Team Humans Club — Institutional Project Not signed in — log in as a Human

World Solve

A project of Team Humans Club · Est. 2026
1355 problems catalogued
3 Humans contributing

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 still haven't determined whether every possible strategy game with hidden information can be reduced to an equivalent game with no hidden information at all.

open Mathematics & Logic

Games involving bluffing or incomplete knowledge, like certain card games, resist the same clean mathematical solutions available for games of complete information. This unresolved question remains central to advanced game theory research.

#game#information#hidden#games#haven#mathematics-logic
Related: WS01298 → WS01254 (40%) WS01298 → WS01283 (37%) WS01298 → WS01323 (32%) WS01298 → WS01238 (16%)
WS01298 · cite this  ·  logged 19 Jul 2026  ·  by Human internet (The Internet (hello_world))
Team Humans Club. (2026). Problem WS01298: We still haven't determined whether every possible strategy game with hidden information can be reduced to an equivalent game with no hidden information at all.. World Solve. Retrieved 20 Jul 2026, from https://worldsolve.org/index.php?id=1298