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
Author
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 4 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.

afffundunlabeled
An Exploration Tool for Predicting Stealthy Behaviour
Jonathan Tremblay, Pedro J. Rivera Torres, Nir Rikovitch, Clark Verbrugge
2013· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
22
citations
afffundunlabeled
Evaluating strategies for running from the cops
Carsten Moldenhauer, Nathan Sturtevant
2009· article· en· Infoscience (Ecole Polytechnique Fédérale de Lausanne)· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
22
citations
affunlabeled
Strategy Grafting in Extensive Games
Kevin Waugh, Nolan Bard, Michael Bowling
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
*-Minimax Performance in Backgammon
Thomas G. Hauk, Michael Buro, Jonathan Schaeffer
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
21
citations
afffundunlabeled
Memory-Augmented Monte Carlo Tree Search
Chenjun Xiao, Jincheng Mei, Martin Müller
2018· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
21
citations
affno abstractunlabeled
Rediscovering *-Minimax Search
Thomas G. Hauk, Michael Buro, Jonathan Schaeffer
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
21
citations
afffundunlabeled
Artificial Playfulness
Samantha Stahlke, Atiya Nova, Pejman Mirza-Babaei
2019· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
20
citations
affno abstractunlabeled
DF-PN in Go: An Application to the One-Eye Problem
Akihiro Kishimoto, Martin Müller
2004· book-chapter· en· Advances in Computer Games· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
20
citations
affunlabeled
Lazy Cops and Robbers on Hypercubes
Deepak Bal, Anthony Bonato, William B. Kinnersley, Paweł Prałat
2015· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Hex and combinatorics
Ryan Hayward, Jack van Rijswijck
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Current Challenges in Multi-player Game Search
Nathan Sturtevant
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
20
citations
affno abstractunlabeled
An Active Approach to Automatic Case Generation
Michael W. Floyd, Babak Esfandiari
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
19
citations
affno abstractunlabeled
Lemmings is PSPACE-complete
Giovanni Viglietta
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
19
citations
affunlabeled
Can you win at TETRIS?
John Brzustowski
2008· article· en· cIRcle (University of British Columbia)· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Optimal solutions for moving target search
Carsten Moldenhauer, Nathan Sturtevant
2009· article· en· Infoscience (Ecole Polytechnique Fédérale de Lausanne)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
17
citations
affno abstractunlabeled
UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communication+insufficient_payloadconsensus · none
17
citations
affunlabeled
Pathfinding in Games
Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, Dana Nau
2013· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
17
citations
affno abstractunlabeled
QuizMASter - A Multi-Agent Game-Style Learning Activity
Mark Dutchuk, Khalid Aziz Muhammadi, Fuhua Lin
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
17
citations
affno abstractunlabeled
A GGP Feature Learning Algorithm
Nathan Sturtevant, Jonathan Schaeffer
2011· article· de· KI - Künstliche Intelligenz· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrity+insufficient_payloadconsensus · insufficient_payload
16
citations
affunlabeled
The Annual Computer Poker Competition
Nolan Bard, John Hawkin, Jonathan Rubin, Martin Zinkevich
2013· article· en· AI Magazine· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
16
citations
affunlabeled
The Current State of StarCraft AI Competitions and Bots
Michal Čertický, David G. Churchill
2017· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
16
citations
afffundno abstractunlabeled
Solving 7×7 Hex: Virtual Connections and Game-State Reduction
Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck
2004· book-chapter· en· Advances in Computer Games· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
16
citations
affunlabeled
Super Mario Bros. is Harder/Easier Than We Thought
Erik D. Demaine, Giovanni Viglietta, Aaron Williams
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
15
citations
afffundunlabeled
Usertesting Without the User
Samantha Stahlke, Pejman Mirza-Babaei
2018· article· en· Computers in entertainment· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations

How this was built: Screen · Findings · About