mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-21 00:52:25 +01:00
feat: maze generation
This commit is contained in:
parent
b84ed11ee5
commit
95fcae04d8
3
.pylintrc
Normal file
3
.pylintrc
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
[DESIGN]
|
||||||
|
# Maximum number of statements in function / method body
|
||||||
|
max-statements=16
|
||||||
153
main.py
153
main.py
@ -50,7 +50,7 @@ class MazeSolver:
|
|||||||
|
|
||||||
for row_i, row in enumerate(self.maze):
|
for row_i, row in enumerate(self.maze):
|
||||||
for col_i, cell in enumerate(row):
|
for col_i, cell in enumerate(row):
|
||||||
if cell == "maze_data":
|
if cell == "S":
|
||||||
start = (row_i, col_i)
|
start = (row_i, col_i)
|
||||||
elif cell == "E":
|
elif cell == "E":
|
||||||
end = (row_i, col_i)
|
end = (row_i, col_i)
|
||||||
@ -81,26 +81,8 @@ class MazeSolver:
|
|||||||
|
|
||||||
# find path through maze
|
# find path through maze
|
||||||
|
|
||||||
def solve(self):
|
def solve_loop(self, queue, visited):
|
||||||
"""Solves the maze"""
|
""" Goes through maze and finds the path """
|
||||||
queue = []
|
|
||||||
# set means that values inside can not repeat
|
|
||||||
visited = set()
|
|
||||||
# https://docs.python.org/3/library/heapq.html
|
|
||||||
# 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
|
|
||||||
heapq.heappush(
|
|
||||||
queue, (self.heuristic_manhattan(self.start), self.start, [self.start])
|
|
||||||
)
|
|
||||||
|
|
||||||
# Go through queue until it'maze_data empty
|
|
||||||
# Find neighbor (which is not wall) closest to the
|
|
||||||
# END point (based on heuristic)
|
|
||||||
# Go there and repeat
|
|
||||||
# if cannot find path it starts over but skips the path that lead it to
|
|
||||||
# dead end
|
|
||||||
path = None
|
|
||||||
while queue:
|
while queue:
|
||||||
# pop first element of heap
|
# pop first element of heap
|
||||||
# first value is skipped and we only save current position and path
|
# first value is skipped and we only save current position and path
|
||||||
@ -124,6 +106,27 @@ class MazeSolver:
|
|||||||
print()
|
print()
|
||||||
return path
|
return path
|
||||||
|
|
||||||
|
def solve(self):
|
||||||
|
"""Solves the maze"""
|
||||||
|
queue = []
|
||||||
|
# set means that values inside can not repeat
|
||||||
|
visited = set()
|
||||||
|
# https://docs.python.org/3/library/heapq.html
|
||||||
|
# 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
|
||||||
|
heapq.heappush(
|
||||||
|
queue, (self.heuristic_manhattan(self.start), self.start, [self.start])
|
||||||
|
)
|
||||||
|
|
||||||
|
# Go through queue until it'maze_data empty
|
||||||
|
# Find neighbor (which is not wall) closest to the
|
||||||
|
# END point (based on heuristic)
|
||||||
|
# Go there and repeat
|
||||||
|
# if cannot find path it starts over but skips the path that lead it to
|
||||||
|
# dead end
|
||||||
|
return self.solve_loop(queue, visited)
|
||||||
|
|
||||||
# This heuristic returns the Manhattan distance between the given position
|
# This heuristic returns the Manhattan distance between the given position
|
||||||
# and the maze'maze_data end
|
# and the maze'maze_data end
|
||||||
def heuristic_manhattan(self, position):
|
def heuristic_manhattan(self, position):
|
||||||
@ -167,23 +170,27 @@ def print_maze(maze, path=None):
|
|||||||
print(cell, end="")
|
print(cell, end="")
|
||||||
print()
|
print()
|
||||||
|
|
||||||
|
def save_maze(maze, solved=True, path=None, saved_file="Maze", iteration=0):
|
||||||
def save_maze(maze, path=None, saved_file="Maze", iteration=0):
|
|
||||||
"""Saves maze from array to txt file"""
|
"""Saves maze from array to txt file"""
|
||||||
if not os.path.exists("solvedMazes"):
|
if solved:
|
||||||
os.mkdir("solvedMazes")
|
folder_name = "solvedMazes"
|
||||||
with open(f"solvedMazes/{iteration}solved{saved_file}", "w", encoding="utf8") as file:
|
else:
|
||||||
maze_file = file.read()
|
folder_name = "generatedMazes"
|
||||||
if path is None:
|
if not os.path.exists(folder_name):
|
||||||
path = []
|
os.mkdir(folder_name)
|
||||||
for row_i, row in enumerate(maze):
|
with open(f"{folder_name}/{iteration}{saved_file}", "w", encoding="utf8") as maze_file:
|
||||||
for col_i, cell in enumerate(row):
|
if path is None:
|
||||||
if (row_i, col_i) in path:
|
path = []
|
||||||
maze_file.write("*")
|
for row_i, row in enumerate(maze):
|
||||||
else:
|
for col_i, cell in enumerate(row):
|
||||||
maze_file.write(cell)
|
if (row_i, col_i) in path:
|
||||||
maze_file.write("\n")
|
maze_file.write("*")
|
||||||
|
else:
|
||||||
|
maze_file.write(cell)
|
||||||
|
if solved:
|
||||||
|
maze_file.write("\n")
|
||||||
|
if not solved:
|
||||||
|
maze_file.write("\n")
|
||||||
|
|
||||||
def make_maze(width=16, height=8):
|
def make_maze(width=16, height=8):
|
||||||
""" generate maze with given width and height """
|
""" generate maze with given width and height """
|
||||||
@ -214,23 +221,14 @@ def make_maze(width=16, height=8):
|
|||||||
for horizontal_line, vertical_line in zip(hor, ver):
|
for horizontal_line, vertical_line in zip(hor, ver):
|
||||||
maze_data += "".join(horizontal_line + ["\n"] + vertical_line + ["\n"])
|
maze_data += "".join(horizontal_line + ["\n"] + vertical_line + ["\n"])
|
||||||
maze_data_list = list(maze_data)
|
maze_data_list = list(maze_data)
|
||||||
maze_data_list[3 * width + 3] = "maze_data"
|
maze_data_list[3 * width + 3] = "S"
|
||||||
maze_data_list[len(maze_data_list) - (3 * width + 6)] = "E"
|
maze_data_list[len(maze_data_list) - (3 * width + 6)] = "E"
|
||||||
maze_data = "".join(maze_data_list)
|
maze_data = "".join(maze_data_list)
|
||||||
return maze_data
|
return maze_data
|
||||||
|
|
||||||
|
def print_help():
|
||||||
# Ran first in the code
|
"""prints help"""
|
||||||
if __name__ == "__main__":
|
print(
|
||||||
start_time = time.perf_counter()
|
|
||||||
# print(sys.argv)
|
|
||||||
FILE_NAME = "maze.txt"
|
|
||||||
TEST_MODE = False
|
|
||||||
FOLDER_NAME = ""
|
|
||||||
if len(sys.argv) > 1:
|
|
||||||
FILE_NAME = sys.argv[1]
|
|
||||||
if sys.argv[1] == "-h" or sys.argv[1] == "--help":
|
|
||||||
print(
|
|
||||||
"""python main.py - run the script against default maze file
|
"""python main.py - run the script against default maze file
|
||||||
(any file named maze.txt in the code directory)
|
(any file named maze.txt in the code directory)
|
||||||
|
|
||||||
@ -240,36 +238,61 @@ python main.py -t --test non interactive (does not print steps) for testing
|
|||||||
different heuristics, goes through entire folder of mazes file and
|
different heuristics, goes through entire folder of mazes file and
|
||||||
compares heuristic speed and path length
|
compares heuristic speed and path length
|
||||||
|
|
||||||
python main.py -g [NUMBER] - generates as many mazes as entered in
|
python main.py -g --generate [NUMBER] - generates as many mazes as entered in
|
||||||
Number parameter and puts it in the mazes folder"""
|
Number parameter and puts it in the mazes folder"""
|
||||||
)
|
)
|
||||||
|
|
||||||
|
def test_mode():
|
||||||
|
""" Loads and solves multiple mazes in order to compare heuristics """
|
||||||
|
for filename in os.listdir(FOLDER_NAME):
|
||||||
|
filename_directory = os.path.join(FOLDER_NAME, filename)
|
||||||
|
print(filename_directory)
|
||||||
|
# Open and load text file to array
|
||||||
|
loaded_maze_test = load_maze(filename_directory)
|
||||||
|
# Initialize MazeSolver object with maze as parameter
|
||||||
|
solver_test = MazeSolver(loaded_maze_test, TEST_MODE)
|
||||||
|
# Find path using MazeSolver solve method
|
||||||
|
solved_path = solver_test.solve()
|
||||||
|
save_maze(loadedMaze, True, solved_path, filename, 0)
|
||||||
|
|
||||||
|
|
||||||
|
# Ran first in the code
|
||||||
|
if __name__ == "__main__":
|
||||||
|
start_time = time.perf_counter()
|
||||||
|
# print(sys.argv)
|
||||||
|
FILE_NAME = "maze.txt"
|
||||||
|
TEST_MODE = False
|
||||||
|
FOLDER_NAME = ""
|
||||||
|
GENERATE_AMOUNT = 0
|
||||||
|
if len(sys.argv) > 1:
|
||||||
|
FILE_NAME = sys.argv[1]
|
||||||
|
if sys.argv[1] == "-h" or sys.argv[1] == "--help":
|
||||||
|
print_help()
|
||||||
sys.exit()
|
sys.exit()
|
||||||
if sys.argv[1] == "-t" or sys.argv[1] == "--test":
|
if sys.argv[1] == "-t" or sys.argv[1] == "--test":
|
||||||
TEST_MODE = True
|
TEST_MODE = True
|
||||||
FILE_NAME = "maze.txt"
|
FILE_NAME = "maze.txt"
|
||||||
if len(sys.argv) > 2:
|
if len(sys.argv) > 2:
|
||||||
FOLDER_NAME = sys.argv[2]
|
FOLDER_NAME = sys.argv[2]
|
||||||
|
if sys.argv[1] == '-g' or sys.argv[1] == '--generate':
|
||||||
|
if len(sys.argv) > 2:
|
||||||
|
GENERATE_AMOUNT = int(sys.argv[2])
|
||||||
|
if GENERATE_AMOUNT > 0:
|
||||||
|
for n in range(GENERATE_AMOUNT):
|
||||||
|
GENERATED_MAZE = make_maze()
|
||||||
|
save_maze(GENERATED_MAZE, False, None, f'generated{n}.txt')
|
||||||
|
sys.exit()
|
||||||
# Open and load text file to array
|
# Open and load text file to array
|
||||||
loadedMaze = load_maze(FILE_NAME)
|
loadedMaze = load_maze(FILE_NAME)
|
||||||
# Initialize MazeSolver object with maze as parameter
|
# Initialize MazeSolver object with maze as parameter
|
||||||
solver = MazeSolver(loadedMaze, TEST_MODE)
|
solver = MazeSolver(loadedMaze, TEST_MODE)
|
||||||
# Find path using MazeSolver solve method
|
# Find path using MazeSolver solve method
|
||||||
solvedPath = solver.solve()
|
SOLVED_PATH = solver.solve()
|
||||||
if not TEST_MODE:
|
if not TEST_MODE:
|
||||||
print_maze(loadedMaze, solvedPath)
|
print_maze(loadedMaze, SOLVED_PATH)
|
||||||
if TEST_MODE and FOLDER_NAME != "":
|
if TEST_MODE and FOLDER_NAME != "":
|
||||||
for filename in os.listdir(FOLDER_NAME):
|
test_mode()
|
||||||
filename_directory = os.path.join(FOLDER_NAME, filename)
|
save_maze(loadedMaze, True, SOLVED_PATH, FILE_NAME, 0)
|
||||||
print(filename_directory)
|
|
||||||
# Open and load text file to array
|
|
||||||
loadedMaze = load_maze(filename_directory)
|
|
||||||
# Initialize MazeSolver object with maze as parameter
|
|
||||||
solver = MazeSolver(loadedMaze, TEST_MODE)
|
|
||||||
# Find path using MazeSolver solve method
|
|
||||||
solvedPath = solver.solve()
|
|
||||||
save_maze(loadedMaze, solvedPath, filename, 0)
|
|
||||||
save_maze(loadedMaze, solvedPath, FILE_NAME, 0)
|
|
||||||
end_time = time.perf_counter()
|
end_time = time.perf_counter()
|
||||||
execution_time = end_time - start_time
|
execution_time = end_time - start_time
|
||||||
print(make_maze())
|
|
||||||
print(f"The execution time is: {execution_time}")
|
print(f"The execution time is: {execution_time}")
|
||||||
|
|||||||
@ -1,10 +0,0 @@
|
|||||||
##########
|
|
||||||
#S #
|
|
||||||
# #### #
|
|
||||||
# # #
|
|
||||||
# # ## #
|
|
||||||
# # #
|
|
||||||
##### ##
|
|
||||||
# # #
|
|
||||||
# #E #
|
|
||||||
##########
|
|
||||||
@ -1,10 +0,0 @@
|
|||||||
##########
|
|
||||||
#S #
|
|
||||||
# #### #
|
|
||||||
# # #
|
|
||||||
# # ## #
|
|
||||||
# # #
|
|
||||||
##### ##
|
|
||||||
# # #
|
|
||||||
# #E #
|
|
||||||
##########
|
|
||||||
@ -1,5 +0,0 @@
|
|||||||
#################
|
|
||||||
# #
|
|
||||||
# ####### #
|
|
||||||
#S # E#
|
|
||||||
#################
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
################################
|
|
||||||
# S # # #
|
|
||||||
# ######### #### ## # #
|
|
||||||
# # # # #
|
|
||||||
# # ######### ####### #
|
|
||||||
# # # #
|
|
||||||
# # #### # ####### #######
|
|
||||||
# # # # # #
|
|
||||||
# ####### ########### # #
|
|
||||||
# # ##### #
|
|
||||||
#### ######### # # # #
|
|
||||||
# # # #### #
|
|
||||||
#### ########### # #
|
|
||||||
# # ##### #####
|
|
||||||
# ######### # # #
|
|
||||||
# ###### #####
|
|
||||||
# ####### ####### #
|
|
||||||
# # # # #####
|
|
||||||
# # ######### # # #
|
|
||||||
# # # # ######
|
|
||||||
# ####### ######### #
|
|
||||||
# # #
|
|
||||||
# ######### ############ #
|
|
||||||
# # # #
|
|
||||||
# ######### #### ####### #
|
|
||||||
# # # # #
|
|
||||||
# # ####### # ######### #
|
|
||||||
# # # # # #
|
|
||||||
# # # #### ######### ####
|
|
||||||
# # # # #
|
|
||||||
# ######### ###### ##### #
|
|
||||||
################################
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
################################
|
|
||||||
# # # #
|
|
||||||
# ######### #### ## # #
|
|
||||||
# # # # #
|
|
||||||
# # ######### ####### #
|
|
||||||
# # # #
|
|
||||||
# # #### # ####### #######
|
|
||||||
# # # # # #
|
|
||||||
# ####### ########### # #
|
|
||||||
# # ##### #
|
|
||||||
#### ######### # # # #
|
|
||||||
# # # #### #
|
|
||||||
#### ########### # #
|
|
||||||
# # ##### #####
|
|
||||||
# ######### # # #
|
|
||||||
# ###### #####
|
|
||||||
# ####### ####### #
|
|
||||||
# # # # #####
|
|
||||||
# # ######### # # #
|
|
||||||
# # # # ######
|
|
||||||
# ####### ######### #
|
|
||||||
# # #
|
|
||||||
# ######### ############ #
|
|
||||||
# # # #
|
|
||||||
# ######### #### ####### #
|
|
||||||
# # # # #
|
|
||||||
# # ####### # ######### #
|
|
||||||
# # # # # #
|
|
||||||
# # # #### ######### ####
|
|
||||||
# # # # #
|
|
||||||
# ######### ###### ##### #
|
|
||||||
################################
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
################################
|
|
||||||
# # # #
|
|
||||||
# ######### #### ## # #
|
|
||||||
# # # # #
|
|
||||||
# # ######### ####### #
|
|
||||||
# # # #
|
|
||||||
# # #### # ####### #######
|
|
||||||
# # # # # #
|
|
||||||
# ####### ########### # #
|
|
||||||
# # ##### #
|
|
||||||
#### ######### # # # #
|
|
||||||
# # # #### #
|
|
||||||
#### ########### # #
|
|
||||||
# # ##### #####
|
|
||||||
# ######### # # #
|
|
||||||
# ###### #####
|
|
||||||
# ####### ####### #
|
|
||||||
# # # # #####
|
|
||||||
# # ######### # # #
|
|
||||||
# # # # ######
|
|
||||||
# ####### ######### #
|
|
||||||
# # #
|
|
||||||
# ######### ############ #
|
|
||||||
# # # #
|
|
||||||
# ######### #### ####### #
|
|
||||||
# # # # #
|
|
||||||
# # ####### # ######### #
|
|
||||||
# # # # # #
|
|
||||||
# # # #### ######### ####
|
|
||||||
# # # # # #
|
|
||||||
# ######### ###### #####E#
|
|
||||||
################################
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
################################
|
|
||||||
# # # #
|
|
||||||
# ######### #### ## # #
|
|
||||||
# # # # #
|
|
||||||
# # ######### ####### #
|
|
||||||
# # # #
|
|
||||||
# # #### # ####### #######
|
|
||||||
# # # # # #
|
|
||||||
# ####### ########### # #
|
|
||||||
# # ##### #
|
|
||||||
#### ######### # # # #
|
|
||||||
# # # #### #
|
|
||||||
#### ########### # #
|
|
||||||
# # ##### #####
|
|
||||||
# ######### # # #
|
|
||||||
# ###### #####
|
|
||||||
# ####### ####### #
|
|
||||||
# # # # #####
|
|
||||||
# # ######### # # #
|
|
||||||
# # # # ######
|
|
||||||
# ####### ######### #
|
|
||||||
# # #
|
|
||||||
# ######### ############ #
|
|
||||||
# # # #
|
|
||||||
# ######### #### ####### #
|
|
||||||
# # # # #
|
|
||||||
# # ####### # ######### #
|
|
||||||
# # # # # #
|
|
||||||
# # # #### ######### ####
|
|
||||||
# # # # #
|
|
||||||
# ######### ###### #####E#
|
|
||||||
################################
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
################################
|
|
||||||
# S # # #
|
|
||||||
# ######### #### ## # #
|
|
||||||
# # # # #
|
|
||||||
# # ######### ####### #
|
|
||||||
# # # #
|
|
||||||
# # #### # ####### #######
|
|
||||||
# # # # # #
|
|
||||||
# ####### ########### # #
|
|
||||||
# # ##### #
|
|
||||||
#### ######### # # # #
|
|
||||||
# # # #### #
|
|
||||||
#### ########### # #
|
|
||||||
# # ##### #####
|
|
||||||
# ######### # # #
|
|
||||||
# ###### #####
|
|
||||||
# ####### ####### #
|
|
||||||
# # # # #####
|
|
||||||
# # ######### # # #
|
|
||||||
# # # # ######
|
|
||||||
# ####### ######### #
|
|
||||||
# # #
|
|
||||||
# ######### ############ #
|
|
||||||
# # # #
|
|
||||||
# ######### #### ####### #
|
|
||||||
# # # # #
|
|
||||||
# # ####### # ######### #
|
|
||||||
# # # # # #
|
|
||||||
# # # #### ######### ####
|
|
||||||
# # # # # #
|
|
||||||
# ######### ###### #####E#
|
|
||||||
################################
|
|
||||||
@ -1,10 +0,0 @@
|
|||||||
##########
|
|
||||||
#******* #
|
|
||||||
# ####* #
|
|
||||||
# # **#
|
|
||||||
# # ##*#
|
|
||||||
# #**#
|
|
||||||
##### *##
|
|
||||||
# # * #
|
|
||||||
# #* #
|
|
||||||
##########
|
|
||||||
@ -1,10 +0,0 @@
|
|||||||
##########
|
|
||||||
#******* #
|
|
||||||
# ####* #
|
|
||||||
# # **#
|
|
||||||
# # ##*#
|
|
||||||
# #**#
|
|
||||||
##### *##
|
|
||||||
# # * #
|
|
||||||
# #* #
|
|
||||||
##########
|
|
||||||
Loading…
Reference in New Issue
Block a user