kuhyx/WUT_Computer_Science
1
0
Fork 0
mirror of https://github.com/kuhyx/WUT_Computer_Science.git synced 2026-07-04 19:23:03 +02:00
Code Issues Actions Packages Projects Releases Wiki Activity

chore: change heuristic to euclidean, make random heuristic work

Browse Source
This commit is contained in:
Krzysztof Rudnicki 2023-03-28 18:42:33 +02:00
parent 155c718df6
commit cf9f4f108f
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
main.py
View File

@ -100,7 +100,7 @@ class MazeSolver:
for neighbor in self.get_neighbors(current):
if neighbor not in visited:
new_path = path + [neighbor]
heuristic, heuristic_time = self.heuristic_manhattan(neighbor)
heuristic, heuristic_time = self.heuristic_euclidean(neighbor)
heuristic_total_time += heuristic_time
heuristics_called += 1
heapq.heappush(
@ -120,7 +120,7 @@ class MazeSolver:
# push onto the queue (which becomes heapq), element containing values
# we use heapq so the element with lowest heuristic value will always
# be at the top of heap
heuristic = self.heuristic_manhattan(self.start)
heuristic = self.heuristic_euclidean(self.start)
heapq.heappush(
queue, (heuristic, self.start, [self.start])
)
@ -155,7 +155,7 @@ class MazeSolver:
heuristic_time = end_time - start_time
return heuristic, heuristic_time
def heuristic_random(self):
def heuristic_random(self, position):
"""Heuristic function that just returns random value between 0 and 1"""
start_time = time.perf_counter()
heuristic = random()