Abstract
Intelligent narrative systems coordinate a cast of non-player characters to make the story experience meaningful for the player. Narrative generation involves a tradeoff between plot-structure requirements and quality of character behavior. We study this tradeoff using the example of narrative planning benchmarks. A narrative planning problem calls for a sequence of actions that leads to an overall plot goal being met, while creating the appearance of character autonomy. We consider simplified solution definitions that enforce only plot requirements or only character requirements, and we measure how often each of these definitions leads to a solution that happens to meet both types of requirements. We then investigate whether solution densities can guide the selection of narrative planning algorithms. We compare the performance of two search strategies---one that satisfies plot requirements first and checks character requirements afterward, and one that continuously verifies character requirements. Our results show that comparing solution densities does not by itself predict which of these search strategies will be more efficient, suggesting that other important factors exist. The results also highlight the diversity and difficulty of solving narrative planning problems. Our work opens further investigation into characterizing narrative planning algorithms and how they interact with specific domains.
Funding Information
  • National Science Foundation (IIS-1911053)

This publication has 27 references indexed in Scilit: