MétaCan
Menu
Back to cohort
Record W1605378659

A Generalized Framework for Analyzing Capturing Races in Go.

2002· article· en· W1605378659 on OpenAlexaff
Martin Müller

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsSimple (philosophy)SolverComputer scienceCover (algebra)Upper and lower boundsRace (biology)Theoretical computer scienceSection (typography)Game theoryBasis (linear algebra)Element (criminal law)Resolution (logic)Mathematical economicsMathematicsArtificial intelligenceLawProgramming language
DOInot available

Abstract

fetched live from OpenAlex

Capturing races or semeai are an important element of Go strategy and tactics. We extend previous work on semeai [1] by introducing a more general framework for analyzing semeai, based on the new concepts of conditional combinatorial games and liberty count games. We show how this framework encompasses earlier concepts such as plain liberty regions and plain eye regions. Furthermore, we discuss how to use upper and lower bounds on such games in a semeai solver.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.012
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0040.003
Science and technology studies0.0010.004
Scholarly communication0.0030.007
Open science0.0040.004
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0070.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.072
GPT teacher head0.316
Teacher spread0.244 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicArtificial Intelligence in GamesFrench-language works237,207