Maze Solver is a demonstration of how genetic algorithms can be utilized to move
an agent from a given position to a goal in a maze environment. It reads a maze
located in the
board.json
file where #, S, and G indicate a wall, start position, and goal,
respectively.
It is written as a part of a mandatory assignment in the course Artificial Life & Evolutionary Robotics: Theory, Methods and Art at the IT University of Copenhagen.
- Ruby (2.6.0) or newer.
Simply run bundle to install dependencies.
Run the algorithm and step through the maze by pressing enter:
./bin/maze_solver
Run the test suite:
rspec
See LICENSE.