Solution in python done

Author: FPG-992

3rd_set/return_to_athens_python/Moves.py

@@ -0,0 +1,56 @@
+import sys
+import heapq as heapriorityqueue
+
+DIRECTIONS = {
+    'N': (-1, 0), 'S': (1, 0), 'E': (0, 1), 'W': (0, -1),
+    'NE': (-1, 1), 'NW': (-1, -1), 'SE': (1, 1), 'SW': (1, -1)
+}
+
+def parse_input(file_path):
+    with open(file_path, 'r') as file:
+        lines = file.readlines()
+    n = int(lines[0].strip())
+    grid = [list(map(int, line.split())) for line in lines[1:]]
+    return n, grid
+
+def is_valid(x, y, n):
+    return 0 <= x < n and 0 <= y < n
+
+def find_path(n, grid):
+    start = (0, 0)
+    goal = (n - 1, n - 1)
+    priorityqueue = [(0, start, [])]
+    visited = set()
+    
+    while priorityqueue:
+        cost, (x, y), path = heapriorityqueue.heappop(priorityqueue)
+        
+        if (x, y) in visited:
+            continue
+        visited.add((x, y))
+        
+        if (x, y) == goal:
+            return path
+        
+        for direction, (dx, dy) in DIRECTIONS.items():
+            nx, ny = x + dx, y + dy
+            if is_valid(nx, ny, n) and grid[nx][ny] < grid[x][y]:
+                heapriorityqueue.heappush(priorityqueue, (cost + 1, (nx, ny), path + [direction]))
+    
+    return "IMPOSSIBLE"
+
+def main():
+    if len(sys.argv) != 2:
+        print("Usage: python3 moves.py <input_file>")
+        return
+
+    input_file = sys.argv[1]
+    n, grid = parse_input(input_file)
+    result = find_path(n, grid)
+    if result == "IMPOSSIBLE":
+        print(result)
+    else:
+        print('[' + ','.join(result) + ']')
+
+if __name__ == "__main__":
+    main()

3rd_set/return_to_athens_python/grid1.txt

@@ -0,0 +1,6 @@
+5
+15 42 3 4 7
+17 13 67 4 32
+4 10 21 9 6
+20 7 4 20 5
+105 1 5 3 2

3rd_set/return_to_athens_python/grid2.txt

@@ -0,0 +1,7 @@
+6
+88 73 71 65 54 53
+90 103 87 76 85 49
+4 29 33 38 62 47
+101 28 43 67 42 44
+27 25 32 47 100 89
+6 22 22 17 11 4

3rd_set/return_to_athens_python/grid3.txt

@@ -0,0 +1,3 @@
+2
+42 17
+17 42