CATSAT: A practical, embedded, SAT language for runtime PCG

Ian D Horswill*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

Answer-set programming (ASP), a family of SAT-based logic programming systems, is attractive for procedural content generation. Unfortunately, current solvers present significant barriers to runtime use in games. In this paper, I discuss some of the issues involved, and present CatSAT, a solver designed to better fit the run-time resource constraints of modern games. Although intended only for small problems, it allows designers to compactly specify simple PCG problems such as NPC generation, solve them in a few tens of microseconds, and to adapt solutions dynamically based on the changing needs of gameplay. We hope that by making adoption as convenient as possible, we can increase the uptake of declarative techniques among developers.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2018
PublisherAAAI Press
Pages38-44
Number of pages7
ISBN (Electronic)9781577358046
StatePublished - Jan 1 2018
Event14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2018 - Edmonton, Canada
Duration: Nov 13 2018Nov 17 2018

Publication series

NameProceedings of the 14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2018

Conference

Conference14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2018
Country/TerritoryCanada
CityEdmonton
Period11/13/1811/17/18

ASJC Scopus subject areas

  • Visual Arts and Performing Arts
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'CATSAT: A practical, embedded, SAT language for runtime PCG'. Together they form a unique fingerprint.

Cite this