AIIDE 2026
The 22nd AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2026) is the next in an annual series of conferences showcasing interdisciplinary research on modeling,...
We are thrilled to announce that AIIDE-26 will be held at the Federal University of Minas Gerais, Belo Horizonte, MG, Brazil from November 9-13, 2026! Paper abstracts due June 19 with full submissions due June 26, 2026. sites.google.com/view/aiide20...
12.01.2026 17:18
π 9
π 4
π¬ 0
π 2
#AIIDE25 wrapped! Thanks to everyone who made this yearβs @aiide.bsky.social such a success. Weβll be back soon with announcements for β26βs location and call, plus the β25 recordings. But for now Iβm going to turn off my brain for 48 hours.
15.11.2025 00:40
π 22
π 5
π¬ 0
π 0
For those who couldn't make it to Edmonton, Emily Halina is live-posting paper sessions!
11.11.2025 02:59
π 2
π 0
π¬ 0
π 0
The final keynote for AIIDE'25 is on Artificial Agency's (
@artificial-agency.bsky.social ) behaviour engine, presented by Chris Entwistle.
A box lunch will be provided for this last-day lunch keynote π±
07.11.2025 18:33
π 1
π 0
π¬ 0
π 0
If youβre interested in attending only the #AIIDE25 Welcome Event or Poster/Demo session, you can use the separate registration links below:
Welcome Event separate registration: aaaiforms.wufoo.com/forms/aiide2...
Poster/Demo Session separate registration: aaaiforms.wufoo.com/forms/aiide2...
01.11.2025 18:42
π 1
π 2
π¬ 0
π 1
AIIDEΒ΄25 features a keynote by Dr. Jonathan Schaeffer, 50 year veteran in the field who will share valuable lessons from his career.
27.10.2025 18:53
π 3
π 2
π¬ 0
π 0
With this we are all caught up! Stay tuned for the 2025 best paper award in November!
27.10.2025 18:48
π 0
π 0
π¬ 0
π 0
π Best Paper β 2024
Generalized Entropy and Solution Information for Measuring Puzzle Difficulty by Shen and Sturtevant
Puzzle entropy uses information entropy with respect to player knowledge to measure the difficulty of a puzzle. The paper generalizes and refines this idea.
27.10.2025 18:46
π 2
π 1
π¬ 1
π 0
π Best Paper β 2024
Generalized Entropy and Solution Information for Measuring Puzzle Difficulty by Shen and Sturtevant
Puzzle entropy uses information entropy with respect to player knowledge to measure the difficulty of a puzzle. The paper generalizes and refines this idea.
27.10.2025 18:46
π 2
π 1
π¬ 1
π 0
We are happy to welcome Kate Compton @galaxykate.bsky.social as a keynote speaker for AIIDE 2025. Her longtime personal mission is to bring small playful forms of AI to poets, artists, kids and weirdos.
21.10.2025 22:52
π 17
π 6
π¬ 0
π 1
Workshop registration for AIIDE 2025 has been reopened! Thanks everyone for the patience while we sorted out logistics. Register for the joint EXAG and INT workshop using the link below!
πhttps://sites.google.com/ualberta.ca/aiide2025/registration
21.10.2025 22:33
π 1
π 1
π¬ 0
π 1
π Best Paper β 2023
There and Back Again: Extracting Formal Domains for Controllable Neurosymbolic Story Authoring by Kelly et al.
Language models create fluent narratives, while planning-based story generators offer control. This paper explores how to combine the best of both!
21.10.2025 22:24
π 0
π 1
π¬ 1
π 0
π Best Paper β 2023
There and Back Again: Extracting Formal Domains for Controllable Neurosymbolic Story Authoring by Kelly et al.
Language models create fluent narratives, while planning-based story generators offer control. This paper explores how to combine the best of both!
21.10.2025 22:24
π 0
π 1
π¬ 1
π 0
π Best Paper β 2022
Puck: A Slow and Personal Automated Game Designer by Michael Cook
The author outlines new goals for automated game design focused on users and communities. The result is Puck, an automated game design system with an exhaustive approach to content generation.
21.10.2025 22:23
π 0
π 1
π¬ 1
π 0
π Best Paper β 2022
Puck: A Slow and Personal Automated Game Designer by Michael Cook
The author outlines new goals for automated game design focused on users and communities. The result is Puck, an automated game design system with an exhaustive approach to content generation.
21.10.2025 22:23
π 0
π 1
π¬ 1
π 0
StarCraft AI Competition
The #AIIDE25 StarCraft AI competition submission deadline is fast approaching. Be sure to submit your work on time!
β° Submission deadline: October 19th
π More details: www.cs.mun.ca/~dchurchill/...
17.10.2025 00:54
π 1
π 0
π¬ 0
π 0
π¨ Due to a high number of sign-ups for the joint EXAG-INT workshop, weβve temporarily closed registration while we secure a larger venue. Stay tuned for updates!
15.10.2025 14:16
π 2
π 0
π¬ 0
π 0
π Best Paper β 2021
MappyLand: Fast, Accurate Mapping for Console Games by Osborn et al.
Game maps are useful for humans, game-playing agents, and content generation. Mappyland uses a variety of heuristics and algorithms to automatically generate accurate maps from example play.
12.10.2025 00:34
π 1
π 1
π¬ 1
π 0
π Best Paper β 2021
MappyLand: Fast, Accurate Mapping for Console Games by Osborn et al.
Game maps are useful for humans, game-playing agents, and content generation. Mappyland uses a variety of heuristics and algorithms to automatically generate accurate maps from example play.
12.10.2025 00:34
π 1
π 1
π¬ 1
π 0
AIIDE 2025 - Keynote Speakers
Find their bios and the keynote abstract here:
π sites.google.com/ualberta.ca/...
And make sure to register for AIIDE here:
π sites.google.com/ualberta.ca/...
06.10.2025 20:25
π 0
π 0
π¬ 0
π 0
AIIDE 2025 is fast approaching and itβs time to start announcing this yearβs keynote speakers! First up are Dr. Luke Dicken and Nadine Perez from Take-Two Interactive. In this session the Take-Two AI team will discuss how to put theory into practice.
06.10.2025 20:22
π 1
π 2
π¬ 1
π 2
AIIDE 2025 - Registration
π’ One week left! Early bird registration rates are available until October 10th. Early registration is cheaper and helps us get things organized πΎ
sites.google.com/ualberta.ca/...
03.10.2025 18:49
π 1
π 1
π¬ 0
π 1
π Best Paper β 2020
βItβs Unwieldy and It Takes a Lot of Timeβ βChallenges and Opportunities for Creating Agents in Commercial Games by Jacob et al.
Game research should consider industry best practices; this paper interviews creators to identify challenges in making AI agents.
29.09.2025 18:23
π 0
π 1
π¬ 1
π 0
π Best Paper β 2020
βItβs Unwieldy and It Takes a Lot of Timeβ βChallenges and Opportunities for Creating Agents in Commercial Games by Jacob et al.
Game research should consider industry best practices; this paper interviews creators to identify challenges in making AI agents.
29.09.2025 18:23
π 0
π 1
π¬ 1
π 0
AIIDE 2025 - Schedule
Full digital program in-progress
π’ #AIIDE25 schedule has been announced!
sites.google.com/ualberta.ca/...
β° Early registration ends Oct 10, Donβt miss out!
25.09.2025 21:19
π 5
π 3
π¬ 0
π 1
π Best Paper β 2019
Macro Action Selection with Deep Reinforcement Learning in StarCraft by Xu et al.
To reduce the gap between human players and StarCraft bots, Xu et al. propose using a Deep Reinforcement Learning framework to select macro actions instead of predefined rules.
23.09.2025 21:20
π 0
π 1
π¬ 1
π 0
π Best Paper β 2019
Macro Action Selection with Deep Reinforcement Learning in StarCraft by Xu et al.
To reduce the gap between human players and StarCraft bots, Xu et al. propose using a Deep Reinforcement Learning framework to select macro actions instead of predefined rules.
23.09.2025 21:20
π 0
π 1
π¬ 1
π 0
AIIDE 2025 - Registration
Early bird registration for AIIDE-25 is available until October 10th!
sites.google.com/ualberta.ca/...
22.09.2025 19:22
π 1
π 1
π¬ 0
π 0
π Best Paper β 2018
CatSAT: A Practical, Embedded, SAT Language for Runtime PCG by Ian Douglas Horswill.
Runtime constraints can leave few resources available for constraint-based PCG in games. CatSAT is a solver designed with the reality of runtime resources in mind.
17.09.2025 00:28
π 3
π 1
π¬ 1
π 0
π Best Paper β 2018
CatSAT: A Practical, Embedded, SAT Language for Runtime PCG by Ian Douglas Horswill.
Runtime constraints can leave few resources available for constraint-based PCG in games. CatSAT is a solver designed with the reality of runtime resources in mind.
17.09.2025 00:28
π 3
π 1
π¬ 1
π 0