Trunk proto is done might have to change param because its an inefficient cord
This commit is contained in:
@@ -61,7 +61,7 @@ var CircleInts = 0
|
||||
var LogDumpOrdered = []
|
||||
var Order = []
|
||||
var Intersections_from_root = []
|
||||
var TargetCord = [[0,-11], [13,-13], [1,-20]] # HAD TO CHANGE TARGET CORD, IT WAS PREVIOUSLY [2,-10]
|
||||
var TargetCord = [[0,-11], [13,-13], [15,-19]] # HAD TO CHANGE TARGET CORD, IT WAS PREVIOUSLY [2,-10]
|
||||
var CircleCompleted = null
|
||||
var AutoBacktrack = false
|
||||
var IntersectionDict = {"Cord": [], "Data": [] }
|
||||
@@ -80,6 +80,7 @@ var AllSetsToGoal = []
|
||||
var TargetsArray = []
|
||||
var Goal = false
|
||||
var Trunk = []
|
||||
var PreTrunk = []
|
||||
|
||||
func _input(event):
|
||||
#if Current_Position != TargetCord:
|
||||
@@ -102,7 +103,7 @@ func _input(event):
|
||||
elif event.is_action_pressed("ui_accept"):
|
||||
AutoSolve()
|
||||
#print(Tree_Array)
|
||||
|
||||
# print(Current_Position)
|
||||
func _process(delta):
|
||||
FoundGoal()
|
||||
AllObjectsFound()
|
||||
@@ -191,13 +192,26 @@ func AllObjectsFound():
|
||||
CurrentInstructionSet.push_back(AllSetsToGoal[n].size())
|
||||
print("The max is: ", (CurrentInstructionSet).max())
|
||||
var key = CurrentInstructionSet.find(CurrentInstructionSet.max())
|
||||
print("THIS IS THE KEY: ")
|
||||
print(AllSetsToGoal[key])
|
||||
print()
|
||||
print("***********************************")
|
||||
for i in AllSetsToGoal.size():
|
||||
if i != key:
|
||||
print(i)
|
||||
print("The I value is: ", i)
|
||||
for x in AllSetsToGoal[key]:
|
||||
print(x)
|
||||
|
||||
|
||||
if AllSetsToGoal[i].find(x) != -1:
|
||||
var test = []
|
||||
test.push_back(AllSetsToGoal[i].find(x))
|
||||
PreTrunk.push_back(test)
|
||||
print(AllSetsToGoal[i])
|
||||
PreTrunk.erase(PreTrunk.min())
|
||||
PreTrunk = PreTrunk.min()
|
||||
#print(PreTrunk[0])
|
||||
Trunk = AllSetsToGoal[key].slice(PreTrunk[0]+1)
|
||||
print("This is the trunk: ")
|
||||
print(Trunk)
|
||||
print("Test Print ^^^")
|
||||
Move_Check1 = move
|
||||
|
||||
|
||||
@@ -778,7 +792,7 @@ func AutoSolve():
|
||||
DirectionStrengths[n] -= 25
|
||||
elif Individual_Steps.size() >= 1:
|
||||
var Wayback = Individual_Steps[0]
|
||||
if Wayback[0] == DirArray[n]:
|
||||
if Wayback[0] == DirArray[n]:
|
||||
DirectionStrengths[n] -= 25
|
||||
if MoveScore < 15:
|
||||
DirectionStrengths[n] -= MoveScore
|
||||
|
||||
Reference in New Issue
Block a user