Skip to content

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.

License

Notifications You must be signed in to change notification settings

santosr2/ant_labyrinth

Repository files navigation

AntLabyrinth.c

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.

Author

  • Rubens Santos @z1ron

Requirements

  • lib ncurses

Usage

To do list

  • interactive presentation
  • verbose apresentation
  • create beta game
  • to implement maze solving algorithm
  • to implement algorithm A* (A star)
  • to implement sounds
  • adjustment of responsiveness

Removing generated files

  • make clean

About

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.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published