mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
c909da9b08
* pre-commit: Upgrade psf/black for stable style 2023 Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`. * https://github.com/psf/black/blob/main/CHANGES.md#2310 > This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style… Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit. I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
108 lines
3.2 KiB
Python
108 lines
3.2 KiB
Python
from __future__ import annotations
|
|
|
|
DIRECTIONS = [
|
|
[-1, 0], # left
|
|
[0, -1], # down
|
|
[1, 0], # right
|
|
[0, 1], # up
|
|
]
|
|
|
|
|
|
# function to search the path
|
|
def search(
|
|
grid: list[list[int]],
|
|
init: list[int],
|
|
goal: list[int],
|
|
cost: int,
|
|
heuristic: list[list[int]],
|
|
) -> tuple[list[list[int]], list[list[int]]]:
|
|
closed = [
|
|
[0 for col in range(len(grid[0]))] for row in range(len(grid))
|
|
] # the reference grid
|
|
closed[init[0]][init[1]] = 1
|
|
action = [
|
|
[0 for col in range(len(grid[0]))] for row in range(len(grid))
|
|
] # the action grid
|
|
|
|
x = init[0]
|
|
y = init[1]
|
|
g = 0
|
|
f = g + heuristic[x][y] # cost from starting cell to destination cell
|
|
cell = [[f, g, x, y]]
|
|
|
|
found = False # flag that is set when search is complete
|
|
resign = False # flag set if we can't find expand
|
|
|
|
while not found and not resign:
|
|
if len(cell) == 0:
|
|
raise ValueError("Algorithm is unable to find solution")
|
|
else: # to choose the least costliest action so as to move closer to the goal
|
|
cell.sort()
|
|
cell.reverse()
|
|
next_cell = cell.pop()
|
|
x = next_cell[2]
|
|
y = next_cell[3]
|
|
g = next_cell[1]
|
|
|
|
if x == goal[0] and y == goal[1]:
|
|
found = True
|
|
else:
|
|
for i in range(len(DIRECTIONS)): # to try out different valid actions
|
|
x2 = x + DIRECTIONS[i][0]
|
|
y2 = y + DIRECTIONS[i][1]
|
|
if x2 >= 0 and x2 < len(grid) and y2 >= 0 and y2 < len(grid[0]):
|
|
if closed[x2][y2] == 0 and grid[x2][y2] == 0:
|
|
g2 = g + cost
|
|
f2 = g2 + heuristic[x2][y2]
|
|
cell.append([f2, g2, x2, y2])
|
|
closed[x2][y2] = 1
|
|
action[x2][y2] = i
|
|
invpath = []
|
|
x = goal[0]
|
|
y = goal[1]
|
|
invpath.append([x, y]) # we get the reverse path from here
|
|
while x != init[0] or y != init[1]:
|
|
x2 = x - DIRECTIONS[action[x][y]][0]
|
|
y2 = y - DIRECTIONS[action[x][y]][1]
|
|
x = x2
|
|
y = y2
|
|
invpath.append([x, y])
|
|
|
|
path = []
|
|
for i in range(len(invpath)):
|
|
path.append(invpath[len(invpath) - 1 - i])
|
|
return path, action
|
|
|
|
|
|
if __name__ == "__main__":
|
|
grid = [
|
|
[0, 1, 0, 0, 0, 0],
|
|
[0, 1, 0, 0, 0, 0], # 0 are free path whereas 1's are obstacles
|
|
[0, 1, 0, 0, 0, 0],
|
|
[0, 1, 0, 0, 1, 0],
|
|
[0, 0, 0, 0, 1, 0],
|
|
]
|
|
|
|
init = [0, 0]
|
|
# all coordinates are given in format [y,x]
|
|
goal = [len(grid) - 1, len(grid[0]) - 1]
|
|
cost = 1
|
|
|
|
# the cost map which pushes the path closer to the goal
|
|
heuristic = [[0 for row in range(len(grid[0]))] for col in range(len(grid))]
|
|
for i in range(len(grid)):
|
|
for j in range(len(grid[0])):
|
|
heuristic[i][j] = abs(i - goal[0]) + abs(j - goal[1])
|
|
if grid[i][j] == 1:
|
|
# added extra penalty in the heuristic map
|
|
heuristic[i][j] = 99
|
|
|
|
path, action = search(grid, init, goal, cost, heuristic)
|
|
|
|
print("ACTION MAP")
|
|
for i in range(len(action)):
|
|
print(action[i])
|
|
|
|
for i in range(len(path)):
|
|
print(path[i])
|