Another Type of circle Solved

PlayerScript.gd

@@ -214,25 +214,46 @@ func FirstCirclePart():
 	for nums in Intersections.size() - Intersections.find(Root):
 		if nums > 0:
 			Skipping_array.push_back((Intersections.find(Root) - nums) + 1)
-	print(Skipping_array)
+	
+	print("Skipping Array is :  ", Skipping_array)
+	
 	for x in Skipping_array:
-		print(x)
+		print("This is X:  ",x)
+		
 		if Tree_Array[x] == 1:
 			print("Skip")
-			GoToParts()
+			Skip()
 			
 		else:
 			print("Go To")
+			#Goto()
 	
-	
+func Skip():
-func GoToParts():
+	#print("CircleInts: ", CircleInts, " and CircleInts Max:  ", CircleIntsMax)
-	var holder = []
+	if CircleInts + 1 == CircleIntsMax:
-	for n in (CircleManualDistance()):
+		FirstIntChange()
-		#holder.push_back(LogDump[n])
+		GoBack(Individual_Steps[0])
-		holder.push_front(Prev_dir_Opp)
+		Individual_Steps.pop_front()
-		print(holder)
+	else:
-	print(LogDump)
+		for n in 2:
-	#GoBack(holder)
+			print("N is equal to:  ",n)
+			GoBack(Individual_Steps[0])
+			Individual_Steps.pop_front()
+
+func Goto():
+	if CircleInts + 1 == CircleIntsMax:
+		FirstIntChange()
+	else:
+		GoBack(Individual_Steps[0])
+		Individual_Steps.pop_front()
+
+func FirstIntChange():
+	var FirstGoTo = []
+	FirstGoTo.push_front(Prev_dir_Opp)
+	FirstGoTo.append_array(Ordered_Commands_Backward)
+	GoBack(FirstGoTo)
+	print(FirstGoTo)
+
 
 func CircleRootsAndInts():
 	if Cicling == true:
@@ -254,9 +275,9 @@ func SolvinCircleDeadEnds():
 	if CircleManualDistance() != null:
 		for n in CircleManualDistance():
 			GoBack(LogDump[n])
-			#print(Individual_Steps[0])
 		CircleInts -= 1
 		GoBack(Individual_Steps[0])
+		Individual_Steps.pop_front()
 		print(CircleInts)
 
 func CircleManualDistance():