реализован лабиринт

homework03/maze_gui.py

@@ -1,36 +1,48 @@
+"""Creating a GUI"""
+
 import tkinter as tk
+from copy import deepcopy
+from tkinter import messagebox, ttk
 from typing import List
-from tkinter import ttk, messagebox
-from maze import bin_tree_maze, solve_maze, add_path_to_grid
+
+from maze import add_path_to_grid, bin_tree_maze, solve_maze
 
 
 def draw_cell(x, y, color, size: int = 10):
+    """Drawing cells"""
     x *= size
     y *= size
     x1 = x + size
     y1 = y + size
     canvas.create_rectangle(x, y, x1, y1, fill=color)
 
 
-def draw_maze(grid: List[List[str]], size: int = 10):
+def draw_maze(grid: List[List[str | int]], size: int = 10):
+    """Drawing the maze"""
     for x, row in enumerate(grid):
         for y, cell in enumerate(row):
             if cell == " ":
-                color = 'White'
+                color = "White"
             elif cell == "■":
-                color = 'black'
+                color = "black"
             elif cell == "X":
-                color = "red"
+                color = "blue"
             draw_cell(y, x, color, size)
 
 
 def show_solution():
-    maze, path = solve_maze(GRID)
-    maze = add_path_to_grid(GRID, path)
-    if path:
-        draw_maze(maze, CELL_SIZE)
-    else:
-        tk.messagebox.showinfo("Message", "No solutions")
+    """What the solution?"""
+    new_grid = deepcopy(GRID)
+    new_grid, path = solve_maze(new_grid)
+    maze = add_path_to_grid(new_grid, path)
+    draw_maze(maze, CELL_SIZE)
+
+
+def solvable_maze(grid: List[List[str | int]]) -> bool:
+    """Checking if the maze is solvable"""
+    new_grid = deepcopy(grid)
+    _, path = solve_maze(new_grid)
+    return bool(path)
 
 
 if __name__ == "__main__":
@@ -39,9 +51,14 @@ def show_solution():
 
     CELL_SIZE = 10
     GRID = bin_tree_maze(N, M)
+    if not solvable_maze(GRID):
+        print("Maze is not solvable. Trying to regenerate it")
+        GRID = bin_tree_maze(N, M)
+
+    print("Maze is solvable")
 
     window = tk.Tk()
-    window.title('Maze')
+    window.title("Maze")
     window.geometry("%dx%d" % (M * CELL_SIZE + 100, N * CELL_SIZE + 100))
 
     canvas = tk.Canvas(window, width=M * CELL_SIZE, height=N * CELL_SIZE)
@@ -51,4 +68,3 @@ def show_solution():
     ttk.Button(window, text="Solve", command=show_solution).pack(pady=20)
 
     window.mainloop()
-

homework03/test_maze.py

@@ -1,5 +1,6 @@
 import unittest
 from random import seed
+
 import maze
 
 
@@ -272,9 +273,7 @@ def test_shortest_path(self):
             ["■", "■", "■", 5, "■"],
         ]
         second_exit_1 = (4, 3)
-        self.assertEqual(
-            [(4, 3), (3, 3), (3, 2), (3, 1), (3, 0)], maze.shortest_path(grid_1, second_exit_1)
-        )
+        self.assertEqual([(4, 3), (3, 3), (3, 2), (3, 1), (3, 0)], maze.shortest_path(grid_1, second_exit_1))
 
         grid_2 = [
             ["■", "■", "■", "■", "■", 1, "■"],
@@ -326,5 +325,3 @@ def test_shortest_path(self):
 
 if __name__ == "__main__":
     unittest.main()
-
-