Automation of classic Snake game using general and domain specific algorithms in Artificial Intelligence like BFS, Neural Networks, Hamiltonian etc.
This project aims to explore different algorithms which play the game by themselves i.e. essentially making an AI that plays Snake. When playing the game, there is a decision to make each time the snake takes a step forward: continue straight, turn left, or turn right. Our goal is to create an AI to learn how to make this same decision. First assessing the state of the world that the snake lives in, then choosing the move that will keep it alive and continue to grow longer.
Furthermore, this project compares the performance of each algorithm and created graph of Scores versus Number of games played and deduce the average score to find better algorithm.
Performance of algorithms (average score vs algorithm)
