new: kruskal generator

src/amaz_lib/__init__.py

@@ -0,0 +1,5 @@
+from .classes.Cell import Cell
+
+__version__ = "1.0.0"
+__author__ = "us"
+__all__ = ["Cell"]

src/amaz_lib/classes/Cell.py

@@ -0,0 +1,65 @@
+from pydantic import BaseModel, Field
+
+
+class Cell(BaseModel):
+    value: int = Field(ge=0, le=15)
+
+    def __str__(self) -> str:
+        return hex(self.value)
+
+    def set_value(self, value: int) -> None:
+        self.value = value
+
+    def get_value(self) -> int:
+        return self.value
+
+    def set_north(self, is_wall: bool) -> None:
+        if (not is_wall and self.value | 14 == 15) or (
+            is_wall and self.value | 14 != 15
+        ):
+            self.value = self.value ^ (1)
+
+    def get_north(self) -> bool:
+        return self.value & 1 == 1
+
+    def set_est(self, is_wall: bool) -> None:
+        if (not is_wall and self.value | 13 == 15) or (
+            is_wall and self.value | 13 != 15
+        ):
+            self.value = self.value ^ (2)
+
+    def get_est(self) -> bool:
+        return self.value & 2 == 2
+
+    def set_south(self, is_wall: bool) -> None:
+        if (not is_wall and self.value | 11 == 15) or (
+            is_wall and self.value | 11 != 15
+        ):
+            self.value = self.value ^ (4)
+
+    def get_south(self) -> bool:
+        return self.value & 4 == 4
+
+    def set_west(self, is_wall: bool) -> None:
+        if (not is_wall and self.value | 8 == 15) or (
+            is_wall and self.value | 8 != 15
+        ):
+            self.value = self.value ^ (8)
+
+    def get_west(self) -> bool:
+        return self.value & 8 == 8
+
+
+def main() -> None:
+    c = Cell(value=1)
+    print(c.get_north())
+    c.set_north(True)
+    print(c.get_north())
+    c.set_north(True)
+    print(c.get_north())
+    c.set_north(False)
+    print(c.get_north())
+
+
+if __name__ == "__main__":
+    main()

src/amaz_lib/classes/Maze.py

@@ -0,0 +1,15 @@
+from sys import stdout
+import numpy as np
+from pydantic import BaseModel
+
+
+class Maze(BaseModel):
+    maze: np.ndarray
+
+    def __str__(self) -> str:
+        res = ""
+        for _ in self.maze:
+            for cell in self.maze:
+                res += cell
+            res += "\n"
+        return res

src/amaz_lib/generators/kruskal.py

@@ -0,0 +1,83 @@
+from typing import Generator
+import numpy as np
+from ..classes.Cell import Cell
+import math
+
+
+def walls_to_maze(
+    walls: list[tuple[int, int]],
+    height: int,
+    width: int,
+) -> np.ndarray:
+    maze: np.ndarray = np.array(
+        [[Cell(value=0) for _ in range(width)] for _ in range(height)]
+    )
+    for wall in walls:
+        x, y = wall
+        match y - x:
+            case 1:
+                maze[math.trunc((x / width))][x % width].set_est(True)
+                maze[math.trunc((y / width))][y % width].set_west(True)
+            case 5:
+                maze[math.trunc((x / width))][x % width].set_south(True)
+                maze[math.trunc((y / width))][y % width].set_north(True)
+    return maze
+
+
+def is_in_same_set(sets: list[list[int]], wall: tuple[int, int]) -> bool:
+    a, b = wall
+    for set in sets:
+        if a in set and b in set:
+            return True
+        if a in set or b in set:
+            return False
+    return False
+
+
+def merge_sets(sets: list[list[int]], wall: tuple[int, int]) -> None:
+    a, b = wall
+    base_set = None
+    for set in sets:
+        if base_set is None and (a in set or b in set):
+            base_set = set
+        elif base_set and (a in set or b in set):
+            base_set += set
+            sets.remove(set)
+
+
+def kraskal(
+    height: int, width: int
+) -> Generator[np.ndarray, None, np.ndarray]:
+    sets = [[i] for i in range(height * width)]
+    walls = []
+    for h in range(height):
+        for w in range(width - 1):
+            walls += [(w + (width * h), w + (width * h) + 1)]
+    for w in range(width):
+        for h in range(height - 1):
+            walls += [(w + (width * h), w + (width * h) + width)]
+    np.random.shuffle(walls)
+
+    yield walls_to_maze(walls, height, width)
+    for wall in walls:
+        if not is_in_same_set(sets, wall):
+            merge_sets(sets, wall)
+            walls.remove(wall)
+            yield walls_to_maze(walls, height, width)
+    return walls_to_maze(walls, height, width)
+
+
+def main():
+    try:
+        for alg in kraskal(10, 10):
+            maze = alg
+            # print(maze)
+            # print()
+        print(maze)
+
+    except GeneratorExit as maze:
+        print(maze)
+
+
+if __name__ == "__main__":
+    main()