Triple
T8482400
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Go |
E200551
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | perfect-information game |
C7463
|
CONCEPT FINISHED |
How this triple was built (1 step)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: perfect-information game Context triple: [Go, instanceOf, perfect-information game]
-
A.
combinatorial game
chosen
A combinatorial game is a two-player, perfect-information game with no chance elements where players move alternately and the outcome depends solely on their strategic choices under well-defined rules.
-
B.
zero-player game
A zero-player game is a simulation or system that evolves automatically from its initial state without any ongoing input or decisions from human or computer-controlled players.
-
C.
mathematical game
A mathematical game is a structured activity or problem governed by explicit rules in which players make decisions or moves, often analyzed using mathematical concepts such as strategy, probability, and optimization.
-
D.
dynamic game
A dynamic game is a strategic interaction among multiple decision-makers that unfolds over time, where players’ choices at each stage can depend on past actions and information, influencing future payoffs and outcomes.
-
E.
topological game
A topological game is a two-player game played on a topological space where players alternately choose points, sets, or open neighborhoods according to specified rules, with winning conditions defined by topological properties such as convergence, closure, or covering.
- F. None of above.
Provenance (1 batch)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ca831b17988190a1f3f3413d57b820 |
completed | March 30, 2026, 2:05 p.m. |
Created at: March 30, 2026, 6:12 p.m.