Automated filtering of story content based on emotions

A computer-implemented method of writing an automated story, the method comprising:

• receiving, by an automated story writing engine, a story data graph data set including data structured as a graph that includes a plurality of nodes and a plurality of connections among and between the nodes, with each given node including content data corresponding to content that can potentially be used as subject matter for the automated story and emotion value data relating to emotions related to the content of the given node;
• receiving, by the automated story writing engine, an emotion ordering data set corresponding to an order of emotions that is desired to be used in the automated story;
• determining, by the automated story writing engine, an ordering for a subset of nodes, with the subset of nodes including at least some nodes of the plurality of nodes, based, at least in part, upon the emotion ordering data set and the emotion value data of the nodes of the story data graph;
• and
• outputting data corresponding to the ordering of the subset of nodes.

A computer-implemented method of writing an automated story, the method comprising:

• receiving, by an automated story writing engine, a story data graph data set including data structured as a graph that includes a plurality of nodes and a plurality of connections among and between the nodes, with each given node including content data corresponding to:
• (i) content that can potentially be used as subject matter for the automated story, and (ii) emotion value data relating to emotions related to the content of the given node;
• receiving, by the automated story writing engine and from a seeder entity, emotion seed data relating emotions and/or emotional flow that the automated story is desired to exhibit;
• for each given node of the story data graph, translating the emotion value data in the form of a color value for the given node;
• identifying a maximum chromatic polynomial required to adequately cover emotion seed data based, at least in part, upon the color values of the nodes of the story data graph;
• identifying a minimum chromatic polynomial required to adequately cover emotion seed data based, at least in part, upon the color values of the nodes of the story data graph;
• and
• identifying relationships of the maximum chromatic polynomial and the minimum chromatic polynomial by mapping emotions identified by the minimum and maximum chromatic polynomials.