Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/awass04/rat-maze-dfs-algorithm-
A DFS algorithm designed to solve a maze.
https://github.com/awass04/rat-maze-dfs-algorithm-
csharp dfs dfs-algorithm dfs-algorithms dfs-visualization maze maze-algorithms maze-solver rat stack stacks
Last synced: 2 months ago
JSON representation
A DFS algorithm designed to solve a maze.
- Host: GitHub
- URL: https://github.com/awass04/rat-maze-dfs-algorithm-
- Owner: AWass04
- Created: 2024-11-13T01:08:41.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2024-11-20T08:14:57.000Z (2 months ago)
- Last Synced: 2024-11-20T10:08:34.612Z (2 months ago)
- Topics: csharp, dfs, dfs-algorithm, dfs-algorithms, dfs-visualization, maze, maze-algorithms, maze-solver, rat, stack, stacks
- Language: C#
- Homepage:
- Size: 220 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Rat Maze (DFS Algorithm)
I have been tasked to create an algorithm that replicates the rat-in-a-maze experiment in C#.
In this expermiement, The rat or mouse makes its way through the maze while being carefully observed by scientists until it eventually reaches the exit at which it is rewarded with food.
## Criteria
The following criteria needed to be met:
* '0' represents a path
* '1' represents a wall
* The maze must have an enterance an exit.
* The maze must be surrounded by walls.
* The enterance must close off after the rat enters.
* Although an exit is required if there is no exit an error must produce.
* The rat must be able to travel 8 directions: North, North-east, East, South-east, South, South-West, West, North-West
* A set of paths to the exit must be displayed.
All criteria in my program has been met.
## Additional features
Although not required by the criteria, I have included an extra maze to show extra functionality of my maze and made it so it will regularly print the maze to clearly show what is happening. Plus, it will display what the shortest path to the exit is.