79 lines
2.9 KiB
Python
79 lines
2.9 KiB
Python
from Constants import ROWS, COLS
|
|
from Engine.Point import Point
|
|
|
|
|
|
class PathFinder:
|
|
|
|
def __init__(self, board):
|
|
self.board = board
|
|
self.openList = []
|
|
self.cameFrom = {}
|
|
self.gScore = {}
|
|
self.fScore = {}
|
|
self.current = Point(0,0)
|
|
|
|
|
|
def findPath(self,startPoint, endPoint):
|
|
self.openList.append(startPoint)
|
|
self.gScore[startPoint] = 0
|
|
self.fScore[startPoint] = startPoint.distance(endPoint)
|
|
|
|
while self.openList:
|
|
self.current = self.minKey(self.fScore, self.openList)
|
|
|
|
if self.current.__eq__(endPoint):
|
|
return self.reconstructPath()
|
|
|
|
self.openList.remove(self.current)
|
|
|
|
for point in self.getNeighbour(self.current):
|
|
tentativeGScore = self.gScore.get(self.current) + self.current.distance(point)
|
|
if tentativeGScore < self.gScore.get(point, 10000):
|
|
self.cameFrom[point] = self.current
|
|
self.gScore[point] = tentativeGScore
|
|
self.fScore[point] = point.distance(startPoint)
|
|
if(point not in self.openList):
|
|
self.openList.append(point)
|
|
return []
|
|
|
|
def reconstructPath(self):
|
|
totalPath = []
|
|
totalPath.append(self.current)
|
|
while self.current in self.cameFrom:
|
|
self.current = self.cameFrom[self.current]
|
|
totalPath.insert(0,self.current)
|
|
return totalPath
|
|
|
|
def getNeighbour(self, current):
|
|
neighbourlist = []
|
|
point1 = Point(current.getX() + 1, current.getY())
|
|
point2 = Point(current.getX(), current.getY() + 1)
|
|
point3 = Point(current.getX(), current.getY() - 1)
|
|
point4 = Point(current.getX() - 1, current.getY())
|
|
if not (point1.getX() < 0 or point1.getX() > COLS or point1.getY() < 0 or point1.getY() > ROWS or point1.__eq__(current)) and point1 not in self.board.stoneMap:
|
|
neighbourlist.append(point1)
|
|
if not (point2.getX() < 0 or point2.getX() > COLS or point2.getY() < 0 or point2.getY() > ROWS or point2.__eq__(current)) and point2 not in self.board.stoneMap:
|
|
neighbourlist.append(point2)
|
|
if not (point3.getX() < 0 or point3.getX() > COLS or point3.getY() < 0 or point3.getY() > ROWS or point3.__eq__(current)) and point3 not in self.board.stoneMap:
|
|
neighbourlist.append(point3)
|
|
if not (point4.getX() < 0 or point4.getX() > COLS or point4.getY() < 0 or point4.getY() > ROWS or point4.__eq__(current)) and point4 not in self.board.stoneMap:
|
|
neighbourlist.append(point4)
|
|
|
|
return neighbourlist
|
|
|
|
|
|
def minKey(self, fscore, openlist):
|
|
minkey = Point(0,0)
|
|
minValue = float('inf')
|
|
for point in openlist:
|
|
value = fscore.get(point, 10000)
|
|
if value < minValue:
|
|
minValue = value
|
|
minkey = point
|
|
return minkey
|
|
|
|
|
|
|
|
|
|
|