adjacent_pair: ap-01f1292318

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

id a_kind a_ref a_label b_kind b_ref b_label bridge distance novelty evidence status asked_by created_ts signal score why prompt reading
ap-01f1292318 problem erdos-872 Consider the two-player game in which players alternately choose integers from $\{2,3,\ldots,n\}$ to be included in some set $A$ (the same set for both players) such that no $a\mid b$ for $a\neq b\in A$. The game ends when no legal move is possible. One player wants the game to last as long as possi problem se-cstheory-1962 Is it NP-hard to play international draughts correctly? Is the following problem NP-hard? Given a board configuration for $n\times n$ international draughts , find a single legal move. The corresponding problem for $n\times n$ American checkers (aka English draughts) is trivially solvable in polynom legal move adjacent-field novel 0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) ยท withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal) withdrawn   2026-09-02T18:10:07Z          

Links from other tables