/ant_labyrinth

This project was developed for the discipline data structure 1, using a search algorithm in a matrix of 10x10, where the starting point is (1,1) and arrival (10,10), where 0 are valid paths and -1 obstacles. The ncurses library was used for graphical environment in text mode.

Primary LanguageCMIT LicenseMIT

Stargazers