Benzon Carlitos Salazar
This repo focuses on the artificial intelligence of the Snake game. The algorithms used are the Shortest Path (which uses a breadth-first search approach) and the Longest Path Problem. I also implement a Greedy approach which directs the snake to eat the food along the shortest path if it thinks the snake will be safe. Otherwise, it will let the snake wander around until a safe path can be found.
Test cases implemented so far (as of 11/11/2020) are all for the basic functions of the snake game. Future implementations will include test cases for all the algorithms used.