private static void CompleteTransitionGraph()
{
if (randomizationError)
{
return;
}
// IDK if this is the right fix but the line is correct and the algo is being rewritten so w/e
foreach (string item in startProgression)
{
im.UpdateReachableLocations(item);
}
int failsafe = 0;
Log("Beginning full placement of transitions...");
while (tm.unplacedTransitions.Any())
{
failsafe++;
if (failsafe > 120)
{
Log("Aborted randomization on too many passes. At the time, there were:");
Log("Unplaced transitions: " + tm.unplacedTransitions.Count);
Log("Reachable transitions: " + tm.reachableTransitions.Count);
Log("Reachable unplaced transitions, directionally compatible: " + tm.placeableCount);
Log("Reachable item locations: " + im.availableCount);
foreach (string t in tm.unplacedTransitions)
{
Log(t + ", in reachable: " + tm.reachableTransitions.Contains(t) + ", is reachable: " + tm.pm.CanGet(t));
}
randomizationError = true;
return;
}
if (im.canGuess && im.availableCount > 1) // give randomized progression as locations are available
{
if (im.FindNextLocation(tm.pm) is string placeLocation)
{
string placeItem = im.GuessItem();
im.PlaceItem(placeItem, placeLocation);
tm.UpdateReachableTransitions(placeItem, true);
}
}
int placeableCount = tm.placeableCount;
if (placeableCount < 4)
{
tm.UpdateReachableTransitions();
}
if (placeableCount == 0 && im.availableCount == 0)
{
Log("Ran out of locations?!?");
randomizationError = true;
return;
}
else if (placeableCount > 2)
{
tm.UnloadReachableStandby();
string transition1 = tm.NextTransition();
string transition2 = tm.dt.GetNextTransition(transition1);
tm.PlaceTransitionPair(transition1, transition2);
//Log($">2 place: {transition1}, {transition2}");
continue;
}
else if (tm.unplacedTransitions.Count == 2)
{
string transition1 = tm.unplacedTransitions[0];
string transition2 = tm.unplacedTransitions[1];
tm.PlaceTransitionPair(transition1, transition2);
//Log($"last place: {transition1}, {transition2}");
continue;
}
else if (placeableCount != 0)
{
if (tm.ForceTransition() is string transition1)
{
string transition2 = tm.dt.GetNextTransition(transition1);
tm.PlaceTransitionPair(transition1, transition2);
//Log($"force place: {transition1}, {transition2}");
continue;
}
}
// Last ditch effort to save the seed. The list is ordered by which items are heuristically likely to unlock transitions at this point.
if (im.FindNextLocation(tm.pm) is string lastLocation)
{
IEnumerable <string> progressionCandidates = new List <string> {
"Mantis_Claw", "Monarch_Wings", "Left_Mantis_Claw", "Right_Mantis_Claw",
"Desolate_Dive", "Isma's_Tear", "Crystal_Heart",
"Mothwing_Cloak", "Shade_Cloak", "Right_Mothwing_Cloak", "Right_Shade_Cloak", "Left_Mothwing_Cloak", "Left_Shade_Cloak"
}
.Where(item => im.randomizedItems.Contains(item));
foreach (string item in progressionCandidates)
{
if (!tm.pm.Has(item))
{
im.PlaceItem(item, lastLocation);
tm.UpdateReachableTransitions(item, true);
break;
}
}
continue;
}
}
Log("Placing last reserved transitions...");
tm.UnloadStandby();
Log("All transitions placed? " + (TransitionManager.transitionPlacements.Count == LogicManager.TransitionNames().Count(t => LogicManager.GetTransitionDef(t).oneWay != 2)));
}
