amazinggame 0.1.0__tar.gz

amazinggame-0.1.0/.gitignore

@@ -0,0 +1,209 @@
+sample_player_client
+
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[codz]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py.cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# UV
+#   Similar to Pipfile.lock, it is generally recommended to include uv.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#uv.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#   https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control
+#poetry.lock
+#poetry.toml
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#   pdm recommends including project-wide configuration in pdm.toml, but excluding .pdm-python.
+#   https://pdm-project.org/en/latest/usage/project/#working-with-version-control
+#pdm.lock
+#pdm.toml
+.pdm-python
+.pdm-build/
+
+# pixi
+#   Similar to Pipfile.lock, it is generally recommended to include pixi.lock in version control.
+#pixi.lock
+#   Pixi creates a virtual environment in the .pixi directory, just like venv module creates one
+#   in the .venv directory. It is recommended not to include this directory in version control.
+.pixi
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.envrc
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+#  JetBrains specific template is maintained in a separate JetBrains.gitignore that can
+#  be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore
+#  and can be added to the global gitignore or merged into this file.  For a more nuclear
+#  option (not recommended) you can uncomment the following to ignore the entire idea folder.
+#.idea/
+
+# Abstra
+# Abstra is an AI-powered process automation framework.
+# Ignore directories containing user credentials, local state, and settings.
+# Learn more at https://abstra.io/docs
+.abstra/
+
+# Visual Studio Code
+#  Visual Studio Code specific template is maintained in a separate VisualStudioCode.gitignore
+#  that can be found at https://github.com/github/gitignore/blob/main/Global/VisualStudioCode.gitignore
+#  and can be added to the global gitignore or merged into this file. However, if you prefer,
+#  you could uncomment the following to ignore the entire vscode folder
+# .vscode/
+
+# Ruff stuff:
+.ruff_cache/
+
+# PyPI configuration file
+.pypirc
+
+# Cursor
+#  Cursor is an AI-powered code editor. `.cursorignore` specifies files/directories to
+#  exclude from AI features like autocomplete and code analysis. Recommended for sensitive data
+#  refer to https://docs.cursor.com/context/ignore-files
+.cursorignore
+.cursorindexingignore
+
+# Marimo
+marimo/_static/
+marimo/_lsp/
+__marimo__/

amazinggame-0.1.0/LICENSE

@@ -0,0 +1,28 @@
+BSD 3-Clause License
+
+Copyright (c) 2026, Vincent Poulailleau
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its
+   contributors may be used to endorse or promote products derived from
+   this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

amazinggame-0.1.0/PKG-INFO

@@ -0,0 +1,14 @@
+Metadata-Version: 2.4
+Name: amazinggame
+Version: 0.1.0
+Project-URL: Homepage, https://github.com/vpoulailleau/amazing
+Author-email: Vincent Poulailleau <vpoulailleau@gmail.com>
+License-File: LICENSE
+Requires-Python: >=3.14
+Requires-Dist: arcade
+Requires-Dist: psutil
+Description-Content-Type: text/markdown
+
+# amazinggame
+
+Course dans un labyrinthe.

amazinggame-0.1.0/README.md

@@ -0,0 +1,3 @@
+# amazinggame
+
+Course dans un labyrinthe.

amazinggame-0.1.0/pyproject.toml

@@ -0,0 +1,85 @@
+[project]
+name = "amazinggame"
+version = "0.1.0"
+requires-python = ">=3.14"
+readme = "README.md"
+authors = [{ name = "Vincent Poulailleau", email = "vpoulailleau@gmail.com" }]
+dependencies = ["arcade", "psutil"]
+
+[project.urls]
+Homepage = "https://github.com/vpoulailleau/amazing"
+
+[tool.uv]
+dev-dependencies = ["pytest", "pytest-cov", "ruff", "ty"]
+package = true
+
+[project.scripts]
+maze-generator = "amazinggame.game.generator:main"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/amazinggame"]
+
+[tool.hatch.build]
+ignore-vcs = true
+
+[tool.hatch.build.targets.sdist]
+only-include = ["src/amazinggame", "LICENSE", "README.md", "pyproject.toml"]
+exclude = [".gitignore"]
+
+[build-system]
+requires = ["hatchling>=1.25"]
+build-backend = "hatchling.build"
+
+[tool.coverage.report]
+exclude_lines = ["pragma: no cover", "if TYPE_CHECKING:"]
+
+[tool.coverage.run]
+omit = [
+    "src/amazinggame/game/server.py",
+    "src/amazinggame/network/*",
+    "src/amazinggame/killall.py",
+    "src/amazinggame/viewer/*",
+]
+
+[tool.ruff]
+target-version = "py314"
+output-format = "pylint"
+fix = true
+
+[tool.ruff.lint]
+preview = true
+select = ["ALL"]
+ignore = [
+    "COM812",
+    "CPY001",
+    "TD",     # allow todo while in dev
+    "FIX002", # allow todo while in dev
+]
+fixable = ["ALL"]
+unfixable = []
+
+[tool.ruff.lint.extend-per-file-ignores]
+"**/tests/**/*.py" = [
+    "S101",    # asserts allowed in tests...
+    "ARG",     # Unused function args -> fixtures nevertheless are functionally relevant...
+    "FBT",     # Don't care about booleans as positional arguments in tests, e.g. via @pytest.mark.parametrize()
+    "PLR2004", # Magic value used in comparison, ...
+    "INP001",  #  Add an `__init__.py`
+    "T201",    # Print statements allowed in tests for debugging purposes, and often left in place for future debugging needs
+    "D",       # Docstrings are often not relevant in tests, and can be a burden to maintain, especially for simple test functions.
+]
+
+[tool.ruff.lint.pydocstyle]
+convention = "google"
+
+[tool.ruff.format]
+preview = true
+quote-style = "double"
+indent-style = "space"
+
+[tool.ty.environment]
+python = "./.venv"
+
+[tool.pytest.ini_options]
+addopts = "-vvv --cov=amazinggame --cov-report term-missing --cov-report html --cov-branch --cov-config=pyproject.toml --full-trace --cov-fail-under=95"
+minversion = "8.0"

amazinggame-0.1.0/src/amazinggame/__init__.py

@@ -0,0 +1 @@
+"""Amazinggame package."""

amazinggame-0.1.0/src/amazinggame/game/__init__.py

@@ -0,0 +1,7 @@
+"""Maze generator package."""
+
+from .cell import Cell
+from .generator import generate_maze
+from .maze import Maze
+
+__all__ = ["Cell", "Maze", "generate_maze"]

amazinggame-0.1.0/src/amazinggame/game/cell.py

@@ -0,0 +1,14 @@
+"""Cell data structure for maze walls."""
+
+from dataclasses import dataclass
+
+
+@dataclass(frozen=False)
+class Cell:
+    """Represents a cell in the maze with wall information.
+
+    Each cell has walls on its top and left sides.
+    """
+
+    top: bool = True
+    left: bool = True

amazinggame-0.1.0/src/amazinggame/game/constants.py

@@ -0,0 +1,7 @@
+"""Shared constants for the game server and gameplay rules."""
+
+MAX_EXPLORATION_DURATION_SECONDS = 180
+MAX_RACE_DURATION_SECONDS = 60
+MAX_NB_PLAYERS = 7
+MAX_BLOCKED_COUNTER = 3
+MAZE_DIMENSION = 15

amazinggame-0.1.0/src/amazinggame/game/game.py

@@ -0,0 +1,117 @@
+"""Core game state and command orchestration."""
+
+from __future__ import annotations
+
+import logging
+from time import perf_counter
+from typing import TYPE_CHECKING, TypedDict
+
+from amazinggame.game import Maze, generate_maze
+from amazinggame.game.constants import (
+    MAX_EXPLORATION_DURATION_SECONDS,
+    MAX_NB_PLAYERS,
+    MAX_RACE_DURATION_SECONDS,
+    MAZE_DIMENSION,
+)
+from amazinggame.game.player import Player, PlayerState
+
+if TYPE_CHECKING:
+    from amazinggame.game.maze import MazeState
+
+logger = logging.getLogger(__name__)
+
+
+class GameState(TypedDict):
+    """Serializable game state sent to clients."""
+
+    time: float
+    players: list[PlayerState]
+    exploration: bool
+    maze: MazeState | None
+    finished: bool
+
+
+class Game:
+    """Runtime container for players, timers, and commands."""
+
+    def __init__(self) -> None:
+        """Initialize game timers and player storage."""
+        self.start_time = perf_counter()
+        self.last_update_time = self.start_time
+        self.cumulated_time = 0.0
+        self.players: list[Player] = []
+        self.maze: Maze = None  # ty: ignore[invalid-assignment]
+        self.exploration_phase = True
+
+    @property
+    def finished(self) -> bool:
+        """Return whether the game has a winner."""
+        return (
+            (
+                all(player.finished for player in self.players)
+                and not self.exploration_phase
+            )
+            or self.cumulated_time
+            >= MAX_EXPLORATION_DURATION_SECONDS + MAX_RACE_DURATION_SECONDS
+        )
+
+    def start(self) -> None:
+        """Reset timers when a game starts."""
+        self.maze = generate_maze(MAZE_DIMENSION, MAZE_DIMENSION)
+        self.start_time = perf_counter()
+        self.last_update_time = self.start_time
+
+    def start_race(self) -> None:
+        """Transition from exploration to race."""
+        self.exploration_phase = False
+        for player in self.players:
+            player.reset()
+
+    def manage_command(self, player_id: int, command: str) -> str:
+        """Dispatch a command to the matching player.
+
+        Returns:
+            The status returned by the player command handler.
+        """
+        if player_id >= len(self.players):
+            logger.error("Unknown player ID: %d", player_id)
+            return "BLOCKED"
+        return self.players[player_id].manage_command(command)
+
+    def add_player(self, player_name: str) -> int | None:
+        """Add a player when the server still has room.
+
+        Returns:
+            Assigned player id, or None when the game is full.
+        """
+        if len(self.players) >= MAX_NB_PLAYERS:
+            return None
+        player = Player(player_name, self)
+        player.id = len(self.players)
+        self.players.append(player)
+        return player.id
+
+    def update(self) -> None:
+        """Advance timers and update every active player."""
+        delta_time = perf_counter() - self.last_update_time
+        for player in self.players:
+            player.update(delta_time)
+        self.last_update_time += delta_time
+        self.cumulated_time += delta_time
+        logger.debug("Cumulated time: %.3f", self.cumulated_time)
+
+    def state(self) -> GameState:
+        """Return a serializable snapshot of the game state.
+
+        Returns:
+            A dictionary containing elapsed time and serialized players.
+        """
+        players: list[PlayerState] = [player.state() for player in self.players]
+        data: GameState = {
+            "time": self.cumulated_time,
+            "finished": self.finished,
+            "players": players,
+            "exploration": self.exploration_phase,
+            "maze": self.maze.serialize() if self.maze is not None else None,
+        }
+        return data

amazinggame-0.1.0/src/amazinggame/game/generator.py

@@ -0,0 +1,154 @@
+"""Maze generation algorithms."""
+
+import random
+from typing import NamedTuple, cast
+
+from amazinggame.game.maze import Maze, Path
+
+
+class WallToRemove(NamedTuple):
+    """Represents a wall to potentially remove during maze generation."""
+
+    x: int
+    y: int
+    is_top: bool
+
+
+class DisjointSet:
+    """Union-find helper for connectivity tracking."""
+
+    def __init__(self, size: int) -> None:
+        """Initialize disjoint set for `size` elements."""
+        self.parent = list(range(size))
+        self.rank = [0] * size
+
+    def find(self, i: int) -> int:
+        """Find root of node i with path compression.
+
+        Returns:
+            Root representative index for node `i`.
+        """
+        if self.parent[i] != i:
+            self.parent[i] = self.find(self.parent[i])
+        return self.parent[i]
+
+    def union(self, i: int, j: int) -> bool:
+        """Union two sets.
+
+        Returns:
+            True when the sets were merged, otherwise False.
+        """
+        ri = self.find(i)
+        rj = self.find(j)
+        if ri == rj:
+            return False
+        if self.rank[ri] < self.rank[rj]:
+            ri, rj = rj, ri
+        self.parent[rj] = ri
+        if self.rank[ri] == self.rank[rj]:
+            self.rank[ri] += 1
+        return True
+
+
+def _wall_neighbors(
+    wall: WallToRemove,
+    width: int,
+    height: int,
+) -> tuple[tuple[int, int] | None, tuple[int, int] | None]:
+    if wall.is_top:
+        a = (wall.x, wall.y - 1)
+        b = (wall.x, wall.y)
+    else:
+        a = (wall.x - 1, wall.y)
+        b = (wall.x, wall.y)
+
+    def _valid(pos: tuple[int, int]) -> bool:
+        px, py = pos
+        return 0 <= px < width and 0 <= py < height
+
+    return (a if _valid(a) else None), (b if _valid(b) else None)
+
+
+def _cell_index(x: int, y: int, width: int) -> int:
+    return y * width + x
+
+
+def carve(
+    maze: Maze,
+    possible_walls: list[WallToRemove],
+) -> None:
+    """Carve walls until the target condition is reached."""
+    dsu = DisjointSet(maze.width * maze.height)
+    for wall in possible_walls:
+        neighbors = _wall_neighbors(wall, maze.width, maze.height)
+        if neighbors[0] is None or neighbors[1] is None:
+            continue
+
+        idx_a = _cell_index(neighbors[0][0], neighbors[0][1], maze.width)
+        idx_b = _cell_index(neighbors[1][0], neighbors[1][1], maze.width)
+        if dsu.find(idx_a) == dsu.find(idx_b):
+            continue
+
+        if wall.is_top:
+            maze.walls[wall.x][wall.y].top = False
+        else:
+            maze.walls[wall.x][wall.y].left = False
+
+        dsu.union(idx_a, idx_b)
+
+
+def generate_maze(
+    width: int,
+    height: int,
+) -> Maze:
+    """Generate a maze by random wall removals with fast connectivity heuristics.
+
+    Returns:
+        A maze where start and end are connected and at least 10 paths are targeted.
+    """
+    maze = Maze(width, height)
+
+    possible_walls: list[WallToRemove] = []
+    for x in range(width):
+        for y in range(height):
+            if y < height - 1:  # horizontal wall below this cell
+                possible_walls.append(WallToRemove(x=x, y=y + 1, is_top=True))
+            if x < width - 1:  # vertical wall to the right
+                possible_walls.append(WallToRemove(x=x + 1, y=y, is_top=False))
+
+    random.shuffle(possible_walls)
+    carve(maze, possible_walls)
+
+    min_paths = 10
+    for wall in possible_walls:
+        if len(maze.paths(0, 0, maze.width - 1, maze.height - 1)) >= min_paths:
+            break
+
+        if wall.is_top:
+            maze.walls[wall.x][wall.y].top = False
+        else:
+            maze.walls[wall.x][wall.y].left = False
+
+    for wall in possible_walls[int(len(possible_walls) * 0.85) :]:
+        if wall.is_top:
+            maze.walls[wall.x][wall.y].top = False
+        else:
+            maze.walls[wall.x][wall.y].left = False
+
+    return maze
+
+
+def main() -> None:
+    """Run the maze generator application."""
+    maze = generate_maze(30, 30)
+    paths: list[Path] = maze.paths(0, 0, 29, 29)
+    print(maze)  # noqa: T201
+    print(f"Number of paths from (0, 0) to (29, 29): {len(paths)}")  # noqa: T201
+    if paths:
+        shortest_path = cast("Path", min(paths, key=len))
+        print("Example path:", shortest_path)  # noqa: T201
+        print(maze.highlighted_path(shortest_path))  # noqa: T201
+
+
+if __name__ == "__main__":
+    main()