Generating Believable Stories in Large Domains
DOI:
https://doi.org/10.1609/aiide.v9i4.12622Keywords:
Monte Carlo Tree Search, Upper Confidence Bounds, UCB, MCTS, Exploration versus ExploitationAbstract
Planning-based techniques are a very powerful tool for automated story generation. However, as the number of possible actions increases, traditional planning techniques suffer from a combinatorial explosion due to large branching factors. In this work, we apply Monte Carlo Tree Search (MCTS) techniques to generate stories in domains with large numbers of possible actions (100+). Our approach employs a Bayesian story evaluation method to guide the planning towards believable stories that reach a user defined goal. We generate stories in a novel domain with different type of story goals. Our approach shows an order of magnitude improvement in performance over traditional search techniques.