No circles for me. Testing the Solvablily

PlayerScript.gd

@@ -167,7 +167,6 @@ func HowManyIntsInCircle():
 	CircleInts =  Tree_Array.size() - Intersections.find(Current_Position)+1
 	print(CircleInts)
 	
-	
 func FirstCirclePart():
 	var count = CircleInts
 	
@@ -296,12 +295,26 @@ func TrackIntersections():
 func MoveAfterIntersection():
 	if move == IntersectionMove+1:
 		if Move_Check6 != move:
-			if TrackBack.size() != 1:
+			if TrackBack.size() != 1 and BackTrack_Array.size() > 1:
 				IntersectionDir.push_back(LogDumpOrdered[0])
+				if BackTrack_Array[-1] - BackTrack_Array[-2] == 1:
+					print(Prev_dir_Opp)
+				else:
+					print(Prev_dir)
 			else:
 				IntersectionDir.push_back(LogDump[0])
+				if BackTrack_Array.size() > 1 and BackTrack_Array[-1] - BackTrack_Array[-2] == 1:
+					print(Prev_dir_Opp)
+				else:
+					print(Prev_dir)
+			CallingDir()
+			print("The Test is here !!!", IntOptions)
 			Move_Check6 = move
 
+func CallingDir():
+	if Intersections.find(Current_Position) != -1 and IntOptions.size() > 1:
+		print(IntOptions[Intersections.find(Current_Position)-1])
+
 func IntersectionDumping():
 	if CurrentInt != "Plain Path" and  Detail_Dict.Type != "Dead End":
 		if Move_Check9 != move or Been_There_Array[-1] == true:
@@ -334,9 +347,10 @@ func IntersectionWaysAvailable():
 			if Colliders[n] == false:
 				Sender.push_back(DirArray[n])
 		IntOptions.push_back(Sender)
-		print(IntOptions)
+		#print(IntOptions)
 	if Move_Check7 != move and TypeOfIntersectionHelper() == "BlanketIntersection" and Detail_Dict.Been_There == true:
-		print(IntOptions)
+		#print(IntOptions)
+		pass
 	Move_Check7 = move