{"data":{"kind":"file","path":"README.md","version_id":"tvor9iz5f4qb2cp843rxtz9s","entry":{"name":"README.md","path":"README.md","is_directory":false,"size":1911,"modified_at":"2026-08-04T13:32:35.599000","content_hash":"6b9a145168871711da1c42d04860d9d9f9f940552cb3edd2cc9c368c9dd78163"},"entries":[],"content":"# Pac-Man Style Maze\n\nA verifiers environment that tasks LLMs with solving and generating Pac-Man style ASCII mazes.\n\n## Tasks\n\n### Pathfinding (default)\nGiven an ASCII maze with Pac-Man (P), ghosts (G), dots (.), power pellets (O), and a cherry goal (C), find the optimal path from P to C while:\n- Collecting as many dots as possible\n- Avoiding ghosts (encountering G = game over)\n- Minimizing path length\n\n### Maze Generation\nGiven dimension specifications, generate a valid Pac-Man maze that:\n- Has walls on all borders\n- Contains P, C, G, O, and dots\n- Is solvable (path from P to C exists)\n\n## Scoring\n\n### Pathfinding\n| Metric | Weight | Description |\n|--------|--------|-------------|\n| Path Validity | 0.35 | Does the path reach C without hitting walls/ghosts? |\n| Dot Collection | 0.25 | Fraction of dots collected |\n| Path Efficiency | 0.25 | Ratio of optimal path length to actual |\n| Format Compliance | 0.15 | Proper use of `<answer>` tags |\n\n### Maze Generation\n| Metric | Weight | Description |\n|--------|--------|-------------|\n| Maze Validity | 0.80 | Dimensions, borders, elements, solvability |\n| Format Compliance | 0.20 | Proper use of `<answer>` tags |\n\n## Usage\n\n```python\nimport verifiers as vf\nenv = vf.load_environment(\"alala/pacman-maze\")\n\n# Or with options:\nenv = vf.load_environment(\"alala/pacman-maze\", task_type=\"pathfinding\", num_samples=30)\nenv = vf.load_environment(\"alala/pacman-maze\", task_type=\"generation\")\n```\n\n## Parameters\n\n| Parameter | Default | Description |\n|-----------|---------|-------------|\n| `task_type` | `\"pathfinding\"` | `\"pathfinding\"` or `\"generation\"` |\n| `num_samples` | `20` | Number of maze problems |\n| `seed` | `42` | Random seed for reproducibility |\n\n## Example Maze\n\n```\n#############\n#P..#...#...#\n#.#.#.#.#.#.#\n#.#...#...#.#\n#.#.#####.#.#\n#.....G.....#\n#.###.###.#.#\n#...O.....#.#\n#.###.###.#.#\n#.........C.#\n#############\n```\n\n## License\n\nMIT\n","encoding":"utf-8","truncated":false,"total_bytes":1911},"status":null}