/// <summary>
/// Method is an entry point that controls the operation of the algorithm (the sequence of launching other methods).
/// </summary>
public void Start()
{
// We read the settings and create the initial state of the world.
// ReadUserSettingsInput();
CreateInitialState();
CreateConstraints();
GenerateNewPDDLDomains();
// We create a start node (root) based on the start state of the world.
StoryNode root = new StoryNode();
root.SetWorldState(currentStoryState);
root.SetActivePlayer(false);
root.SetActiveAgent(currentStoryState.GetFirstAgent());
newStoryGraph.SetRoot(root);
// We go through all the agents and remember their goals.
storyworldConvergence.ExtractGoals(currentStoryState);
// The algorithm calculates a SPECIFIC story.
newStoryGraph = CreateStoryGraph(newStoryGraph.GetRoot());
// Create a visual graph.
graphСonstructor.CreateGraph(newStoryGraph, @"D:\Graphviz\bin\newStoryGraph.dt");
// Create an HTML file including Twine engine and generated history.
//twineGraphConstructor.ConstructGraph(newStoryGraph);
//twineGraphConstructor.CreateHTMLFileWithGame();
// SaveFile();
}
public bool CyclesControl(WorldDynamic currentState,
PlanAction action,
StoryGraph currentGraph,
KeyValuePair <AgentStateStatic, AgentStateDynamic> agent,
StoryNode currentNode,
bool duplicated,
int globalNodeNumber,
bool succsessControl)
{
bool result = false;
// We create a test node similar to the one we are going to add to the graph as a result of the current action.
StoryNode testNode = currentGraph.CreateTestNode(currentState, action, agent, currentNode, !duplicated, globalNodeNumber, succsessControl);
StoryNode duplicatedNode = null;
Edge testEdge = new Edge();
if (!duplicated)
{
duplicatedNode = currentGraph.GetNode(testNode);
if (currentNode.Equals(duplicatedNode))
{
return(false);
}
testEdge.SetUpperNode(ref currentNode);
testEdge.SetLowerNode(ref duplicatedNode);
currentNode.AddEdge(testEdge);
duplicatedNode.AddEdge(testEdge);
currentNode.AddLinkToNode(ref duplicatedNode);
duplicatedNode.AddLinkToNode(ref currentNode);
}
string[] colors = new string[currentGraph.GetNodes().Count + 2];
for (int i = 0; i < currentGraph.GetNodes().Count + 2; i++)
{
colors[i] = "white";
}
result = TarjanAlgStep(currentGraph.GetRoot(), ref colors, !duplicated, duplicatedNode);
if (!duplicated)
{
currentNode.RemoveEdge(testEdge);
currentNode.DeleteLink(duplicatedNode);
duplicatedNode.RemoveEdge(testEdge);
duplicatedNode.DeleteLink(currentNode);
testEdge.ClearUpperNode();
testEdge.ClearLowerNode();
testEdge = null;
}
// We delete the test node and mark the loop test as passed.
currentGraph.DeleteTestNode(ref testNode);
return(result);
}