antxln / maze-solver Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Find optimal solution, if possible, for a maze provided as a string of 0's and 1's

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
README.md		README.md
example.png		example.png
input		input
mopsolver.c		mopsolver.c

Repository files navigation

maze-solver

This course project finds an optimal solution, if possible, for a maze represented as a string of 0's and 1's

Build

gcc mopsolver.c -o mopsolver

Run

./mopsolver -h for help

Example

About

Find optimal solution, if possible, for a maze provided as a string of 0's and 1's

Report repository

Releases

No releases published

Packages

No packages published

Languages

C 100.0%