MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
Sort
Language
Type
Field
Venue
Topic
Artificial Intelligence in Games
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

925 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
925 works in the cohort · of 4,299,418page 1 of 19

Labels cover 0 of 925 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 925 of 925 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Cooperative Pathfinding
2005· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · noneconsensus · none
665
citations
affunlabeled
Checkers Is Solved
2007· article· en· Science· Computer Science
distilled prediction:candidate · noneconsensus · none
436
citations
afffundno abstractunlabeled
The challenge of poker
2002· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
271
citations
affno abstractunlabeled
Games solved: Now and in the future
2002· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
253
citations
affunlabeled
Interactive Storytelling: A Player Modelling Approach
2007· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
200
citations
affno abstractunlabeled
Computer Go
2002· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
180
citations
affunlabeled
Monte Carlo Tree Search in Hex
2010· article· en· IEEE Transactions on Computational Intelligence and AI in Games· Computer Science
distilled prediction:candidate · noneconsensus · none
143
citations
affunlabeled
The grand challenge of computer Go
2012· article· en· Communications of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
136
citations
affunlabeled
Real-time strategy gaines: a new AI research challenge
2003· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
127
citations
affunlabeled
Fast Heuristic Search for RTS Game Combat Scenarios
2012· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
122
citations
affunlabeled
Build Order Optimization in StarCraft
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · noneconsensus · none
101
citations
affno abstractunlabeled
A note on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" overflow="scroll"><mml:mi>l</mml:mi></mml:math>-robber games on graphs
2006· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity
88
citations
afffundno abstractunlabeled
Games, computers, and artificial intelligence
2002· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
74
citations
affunlabeled
Memory-Efficient Abstractions for Pathfinding
2007· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
afffundno abstractunlabeled
Heuristic Search Applied to Abstract Combat Games
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
63
citations

How this was built: Screen · Findings · About