'*Searches the way automatically*
	Method SearchWay:TList() 'Returns the Closed List
		HasFoundWay = False 'Can't have found a way now
		ClearLists() 'Has to clear the lists
		
		'*Loop which fills the Closed List*
		Repeat
			SearchPossibleNewNodes() 'Fills the Open List
			If Not (OpenList.IsEmpty()) Then
				GetNextClosedNode() 'Adds the cheapest Node to the Closed List
			EndIf
		
			'*If the End Node is reached*'
			If (HasFoundWay) Then
				Return ClosedList 'Return the Closed List
			End If
			
		Until OpenList.IsEmpty() 'End the loop if there are no possible Nodes

		Return Null 'Return Null
	End Method
	
	'*Fills the Open List*
	Method SearchPossibleNewNodes()
		OpenList.Clear() 'First Clear the List
		Local Node:TPathNode = TPathNode(ClosedList.Last()) 'Get the last added Node
		Local xPos:Int = Node.iaPos[0]
		Local yPos:Int = Node.iaPos[1]
		
		For Local i:Int = -1 To 1 'Only horizontal
			If (((xPos + i) >= 0) And ((xPos + i) <= (TGameAttributesProvider.Map.iaMapSize[0] - 1)))
				Local PosAr:Int[] = [xpos + i, ypos] 'Same y Position
				Local NewNode:TPathNode = TPathNode.CreateAuto(PosAr)
				OpenList.AddLast(NewNode) 'Add a new Node to the Open List
			EndIf
			If(((ypos + i) >= 0) And ((ypos + i) <= (TGameAttributesProvider.Map.iaMapSize[1] - 1)))
				Local PosAr:Int[] = [xpos, ypos + i] 'Same x Position
				Local NewNode:TPathNode = TPathNode.CreateAuto(PosAr)
				OpenList.AddLast(NewNode) 'Add a new Node to the Open List
			EndIf
		Next
		
		'*Make sure that no Node in the Open List is Also a Node in the Open List*
		For Local OpenNode:TPathNode = EachIn OpenList
			For Local ClosedNode:TPathNode = EachIn ClosedList
				If (OpenNode.iaPos[0] = ClosedNode.iaPos[0]) Then
					If (OpenNode.iaPos[1] = ClosedNode.iaPos[1]) Then
						OpenList.Remove(OpenNode)
					End If
				End If
			Next
		Next
	End Method
	
	'*Add the next Node to the Closed List*
	Method GetNextClosedNode()
		Local ChosenNode:TPathNode = Null
		
		For Local NodeNew:TPathNode = EachIn OpenList
			If (ChosenNode = Null) Then ChosenNode = NodeNew

			If (NodeNew.iCosts < ChosenNode.iCosts) Then
				ChosenNode = NodeNew 'Cheapest Node should be the chosen one
			End If
		Next
		
		'*Found the way if Position is equal to the Position of the Endnode*
		If (ChosenNode.iaPos[0] = EndNode.iaPos[0]) Then
			If (ChosenNode.iaPos[1] = EndNode.iaPos[1]) Then
				HasFoundWay = True
			End If
		End If
		
		ClosedList.AddLast(ChosenNode) 'Add the Node to the List
	End Method

OpenList.Clear() 'First Clear the List