Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ayushpatel2026/a1-maze-runner-ayushpatel2026
a1-maze-runner-Ayushpatel2026 created by GitHub Classroom
https://github.com/ayushpatel2026/a1-maze-runner-ayushpatel2026
Last synced: 5 days ago
JSON representation
a1-maze-runner-Ayushpatel2026 created by GitHub Classroom
- Host: GitHub
- URL: https://github.com/ayushpatel2026/a1-maze-runner-ayushpatel2026
- Owner: Ayushpatel2026
- License: other
- Created: 2024-01-11T20:57:56.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-01-29T02:17:25.000Z (11 months ago)
- Last Synced: 2024-10-31T20:44:13.513Z (about 2 months ago)
- Language: Java
- Size: 57.6 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
[](https://classroom.github.com/a/8jM7fhXE)
# Assignment A1 - Maze Runner
* **Student**: [AYUSH PATEL]([email protected])
* **Program**: B. Eng. In Software Engineering
* **Course code**: SFWRENG 2AA4
* **Course Title**: Software Design I - Introduction to Software Development
* Term: *Level II - Winter 2024*
## Business Logic Specification
This program explores a maze, finding a path from an entry point to an exit one.
- The maze is stored in a text file, with `#` representing walls and `␣` (_empty space_) representing passages.
- You’ll find examples of such mazes in the [`examples`](./examples) directory.
- You can also use the [Maze Generator](https://github.com/ace-lectures/maze-gen) to generate others.
- The Maze is surrounded by walls on its four borders, except for its entry/exit points.
- Entry and exit points are always located on the East and West border.
- The maze is not directed. As such, exit and entry can be interchanged.
- At the beginning of the exploration, we're located on the entry tile, facing the opposite side (e.g., if entering by the eastern entry, you're facing West).
- The program generates a sequence of instructions to reach the opposite exit (i.e., a "path"):
- `F` means 'move forward' according to your current direction
- `R` means 'turn right' (does not move, just change direction), and `L` means ‘turn left’.
- A canonical path contains only `F`, `R` and `L` symbols
- A factorized path squashes together similar instructions (i.e., `FFF` = `3F`, `LL` = `2L`).
- Spaces are ignored in the instruction sequence (only for readability: `FFLFF` = `FF L FF`)
- The program takes as input a maze and print the path on the standard output.
- For this assignment, the path does not have to be the shortest one.
- The program can take a path as input and verify if it's a legit one.
## How to run this software?
To build the program, simply package it with Maven:
```
mosser@azrael A1-Template % mvn -q clean package
```
### Provided version (starter code)
The starter code assumes the maze file name is the first argument.
```
mosser@azrael A1-Template % java -jar target/mazerunner.jar ./examples/small.maz.txt
** Starting Maze Runner
**** Reading the maze from file ./examples/small.maz.txt
WALL WALL WALL WALL WALL WALL WALL WALL WALL WALL WALL
WALL PASS PASS PASS PASS PASS PASS PASS PASS PASS WALL
WALL WALL WALL PASS WALL WALL WALL PASS WALL WALL WALL
WALL PASS PASS PASS PASS PASS WALL PASS PASS PASS WALL
WALL PASS WALL PASS WALL WALL WALL WALL WALL PASS WALL
WALL PASS WALL PASS PASS PASS PASS PASS WALL PASS PASS
WALL WALL WALL PASS WALL PASS WALL WALL WALL WALL WALL
WALL PASS PASS PASS WALL PASS PASS PASS PASS PASS WALL
PASS PASS WALL PASS WALL PASS WALL WALL WALL PASS WALL
WALL PASS WALL PASS WALL PASS WALL PASS PASS PASS WALL
WALL WALL WALL WALL WALL WALL WALL WALL WALL WALL WALL
**** Computing path
PATH NOT COMPUTED
** End of MazeRunner
```
When called on a non-existing file. it prints an error message
```
mosser@azrael A1-Template % java -jar target/mazerunner.jar ./examples/small.maz.txtd
** Starting Maze Runner
**** Reading the maze from file ./examples/small.maz.txtd
/!\ An error has occured /!\
**** Computing path
PATH NOT COMPUTED
** End of MazeRunner
```
### Delivered version
#### Command line arguments
The delivered program at the end of this assignment should use the following flags:
- `-i MAZE_FILE`: specifies the filename to be used;
- `-p PATH_SEQUENCE`: activates the path verification mode to validate that PATH_SEQUENCE is correct for the maze
If you are also delivering the bonus, your program will react to a third flag:
- `-method {tremaux, righthand}`: specifies which path computation method to use. (default is right hand)
#### Examples
When no logs are activated, the programs only print the computed path on the standard output.
```
mosser@azrael A1-Template % java -jar target/mazerunner.jar -i ./examples/straight.maz.txt
4F
mosser@azrael A1-Template %
```
If a given path is correct, the program prints the message `correct path` on the standard output.
```
mosser@azrael A1-Template % java -jar target/mazerunner.jar -i ./examples/straight.maz.txt -p 4F
correct path
mosser@azrael A1-Template %
```
If a given path is incorrect, the program prints the message `incorrect path` on the standard output.
```
mosser@azrael A1-Template % java -jar target/mazerunner.jar -i ./examples/straight.maz.txt -p 3F
inccorrect path
mosser@azrael A1-Template %
```