Truman Yang
Software Systems
In games, AI is the reason behind of programming an opposition player who calls it as the Non-player characters (NPC). To move an NPC’s from one place to another place, searching algorithms are required. Since searching algorithm in a game takes a lot of time, the best searching algorithm is to be implemented in the game to get efficient results. In this project, different AI searching algorithms will be implemented and evaluated in a snake game. Q-learning will be combined with search algorithms to further improve their performance.
In this project, students need to implement a few searching algorithms for a snake game. The performance of different searching algorithms will be compared in terms of the score achieved by each algorithm. In addition, learning ability with Q-learning should be added to search algorithms. The effectiveness of these solutions will also be evaluated.
(1) Your design will be based on existing code of searching and Q-learning algorithms. Further improvement on design and performance evaluation are needed.
(2) Software development with Python should be efficient and effective.
(1) Literature review of Q-learning on games will be conducted.
(2) Familiar with related projects with reading, implementation and evaluation
(3) Idea generation technique with SCAMPER.
Design, implement, and test the algorithms as specified above.
Implement and evaluate searching algorithms for snake game
Implement and evaluate Q-learning algorithm on the snake game
Design Q-learning based searching algorithms
Implement and evaluate Q-learning based searching algorithms
AI-related courses COE318: Software Systems
TY05: Searching Algorithms with Q-learning for Snake game | Truman Yang | Sunday September 5th 2021 at 05:29 PM