Crystal-Maze alternatives and similar shards
Based on the "Examples and funny stuff" category
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.
Do you think we are missing an alternative of Crystal-Maze or a related project?
A* Path finding for PNG mazes, from Ruby now in Crystal! Using StumpyPNG! Now ×40 faster than its Ruby counterpart: A-Star
Build it from source: Clone and enter repository:
git clone https://github.com/Demonstrandum/Crystal-Maze.git && cd Crystal-Maze
and run the make file:
make sudo make install clean #sudo make uninstall # to remove the program
To run the program itself:
This will solve the maze and make and image with the suffix "-solved"
yourImage-solved.png in the same location as the input image.
You can also add optional arguments of heuristic distance type, verbosity and wheather to draw nodes or not. For heuristic distance just type
manhattan as argument for distance calculation type, these are the only two currently supported. Showing nodes is done with the argument
--show-nodes and for verbosity (prints the nodes of the final path) either
maze euclidean -v hipMaze.png --show-nodes
[Maze being solved](mazes/200-solved.gif)
Maze being mapped out by flood and then solved with A*
You can animate the solving with the
--gif argument, this looks better with
--show-nodes as you can see the nodes being placed and spreading. e.g.
maze mazes/50-maze.png --show-nodes --gif
The gif will most likely be very slow, so you can drop some frames to speed it up:
maze mazes/normal.png --show-nodes --gif --gif-speed 14
The above means: only keep every 14th frame.
Be careful, when making GIFs with large mazes, the program will use a lot of memory and may freeze your computer!
Maze PNG requirements
The start and end points of the maze must be white and be from top or left to bottom or right, if this is not true, then it means the maze has a black border, in which case it will find a green pixel (doesn't have to be perfect green) and sets that as the start point and then finds a red pixel (doesn't have to be perfect red) and sets that as the end point.
P.S. It's highly recommended that the maze's walls and paths are 1 pixel wide as the program draws and reads the paths as one pixel.