Interpolating Humour — Can Lines Be Funny?
The use of AI to play games has a long history. Some of the earliest examples were deterministic, fully observable games with clearly defined rules and possible game states. AI has proven best in games of this nature. Games such as checkers are considered solvable (Schaeffer et al., 2007) because there is always an optimal move to be made at any given point in the game, which means an AI agent can mathematically learn the best move.
Authors
- Cǎlin Anton
- O. León (ORCID: https://orcid.org/0000-0003-4983-173X)
- Kevin Ulliac
- Isaac McCracken
Institutions
- MacEwan University (CA)
Publication Details
- Journal
- AI Matters
- Published
- 2025-10-01
- DOI
- https://doi.org/10.1145/3774399.3774405
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00