Skip to main content

A Gymnasium-compatible implementation of hardmaze environment

Project description

Gymnasium HardMaze

Python 3.8+ pre-commit License: MIT Code style: black

A maze navigation simulator for reinforcement learning research, compatible with the Gymnasium API.

Gynasium HardMaze Preview

Overview

Gymnasium HardMaze is a reimplementation of the 'hardmaze' environment used in several neuroevolution research papers. It provides a platform for training and evaluating reinforcement learning agents in navigation tasks of varying complexity.

Key features:

  • XML-based maze configuration
  • Fully compatible with Gymnasium API
  • Deterministic when seeded for reproducible research
  • Visualizations for debugging and demonstrations

Installation

# Basic installation
pip install gymnasium-hardmaze

# For development
git clone https://github.com/Teaspoon-AI/gymnasium-hardmaze.git
cd gymnasium-hardmaze
pip install -e .

Usage

Basic Example

import gymnasium as gym
import gymnasium_hardmaze
import numpy as np

# Create default maze environment
env = gym.make("HardMaze-v0", render_mode="human")

# Reset the environment
observation, info = env.reset(seed=42)

for _ in range(1000):
    # Take a random action
    action = env.action_space.sample()

    # Step the environment
    observation, reward, terminated, truncated, info = env.step(action)

    # Check if episode is done
    if terminated or truncated:
        observation, info = env.reset()

env.close()

Keyboard Control Example

The package includes a keyboard control script for testing environments:

# Run keyboard agent in the hard maze environment
python -m gymnasium_hardmaze.examples.keyboard_agent

Available Environments

Environment ID Description
HardMaze-v0 Complex maze with walls and multiple points of interest

Observation Space

The observation space is a vector containing:

  • Normalized rangefinder readings (distance to walls)
  • Radar readings (binary detection of goal)

Action Space

The action space is a 3-dimensional continuous space:

  • [left_motor, forward, right_motor] with values between 0 and 1

Rewards

The default reward function prioritizes reaching the goal, with partial rewards for visiting points of interest along the way.

Similar Projects

Several other projects provide maze navigation environments for robotics and AI research:

Kheperax

Kheperax is a JAX-based reimplementation of the fastsim simulator that simulates Khepera-like robots in 2D mazes. Key differences from gymnasium-hardmaze:

  • Hardware acceleration: Fully implemented in JAX for GPU/TPU acceleration and massive parallelization
  • Robot model: Simulates circular robots with 2 wheels, configurable laser and bumper sensors
  • Optimization focus: Directly compatible with QDax library for Quality-Diversity optimization
  • Performance: Designed for high-throughput evolutionary algorithms and population-based methods

fastsim_gym

A Gym wrapper for the pyfastsim simulator, also implementing Lehman & Stanley's hard maze. Key differences:

  • Simulation backend: Uses the pyfastsim C++ simulator for physics simulation
  • Robot configuration: Features 3 lasers at specific angles (-π/4, 0, π/4) and two bumpers
  • Map format: Requires binary PBM format maps with specific size constraints
  • API compatibility: Uses the older Gym API rather than the newer Gymnasium standard

How gymnasium-hardmaze differs:

  • Modern API: Built specifically for the Gymnasium API with full compatibility
  • Pure Python: No external simulator dependencies, making installation and debugging easier
  • Research focus: Carefully ported from ES-HyperNEAT codebase for accurate replication

Citation

If you use this software in your research, please cite:

@software{gymnasium-hardmaze,
  author = {Stefano Palmieri},
  title = {HardMaze: A Gymnasium-compatible Implementation of hardmaze environment},
  url = {https://github.com/Teaspoon-AI/gymnasium-hardmaze},
  year = {2025},
}

Acknowledgements

The code in this project is derived from the original source code used in Sebastian Risi's 2011 ES-HyperNEAT paper.

@InProceedings{risi:gecco2011,
  author       = "Sebastian Risi and Kenneth O. Stanley",
  title        = "Enhancing ES-HyperNEAT to Evolve More Complex Regular Neural Networks",
  booktitle    = "Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2010)",
  year         = 2011,
  publisher    = "ACM",
  url          = "http://eplex.cs.ucf.edu/papers/risi_gecco11.pdf"
}

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

gymnasium_hardmaze-0.1.1.tar.gz (23.9 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

gymnasium_hardmaze-0.1.1-py3-none-any.whl (27.4 kB view details)

Uploaded Python 3

File details

Details for the file gymnasium_hardmaze-0.1.1.tar.gz.

File metadata

  • Download URL: gymnasium_hardmaze-0.1.1.tar.gz
  • Upload date:
  • Size: 23.9 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.13.7

File hashes

Hashes for gymnasium_hardmaze-0.1.1.tar.gz
Algorithm Hash digest
SHA256 6b37fe14a1dcfb2410818c0daf43d9a93f8c7dddc1d40aa1c60b0a91a4768b23
MD5 06e4cba95328833408e26c1308c55761
BLAKE2b-256 5fb4e216eb46036589a76b3fd5496ad4b7290b28825a1900e7c7be17312f45cd

See more details on using hashes here.

File details

Details for the file gymnasium_hardmaze-0.1.1-py3-none-any.whl.

File metadata

File hashes

Hashes for gymnasium_hardmaze-0.1.1-py3-none-any.whl
Algorithm Hash digest
SHA256 70459e02e19b4aad71704e49ddf35cd88ea2e9e07f45936a37c0a9fb61886907
MD5 666d370177d3a2118de03d6020c0ebdf
BLAKE2b-256 a1d4c52721826a888f7bcba5b44ecaae93712f36afbc077ecf06070490af7716

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page