Solving the Classic Snake Game Using AI

被引:3
作者
Sharma, Shubham [1 ]
Mishra, Saurabh [1 ]
Deodhar, Nachiket [1 ]
Katageri, Akshay [1 ]
Sagar, Parth [1 ]
机构
[1] RMDSSOE, Comp Engn, Pune, Maharashtra, India
来源
2019 IEEE PUNE SECTION INTERNATIONAL CONFERENCE (PUNECON) | 2019年
关键词
Best First Search; Breadth First Search; Greedy Search; A* Search; A* with Forward Checking; Snake Game; Artificial Intelligence; Random move; Almighty move; Automated Bot;
D O I
10.1109/punecon46936.2019.9105796
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we did survey of various papers based on the classic snake game and compared their various traits and features. In this paper we introduce an AI bot to enhance the skills of the player and the Al bot uses the algorithms further discussed in this paper. Player can follow the simultaneously running AI bot to play the game effectively. In this we use the classic snake game, for that we present different algorithms or methods for AI bot. It includes three searching algorithms related to artificial intelligence, Best First Search, A* Search and improved A* Search with forward checking, and two baseline methods Random Move and Almighty Move [1].
引用
收藏
页数:4
相关论文
共 6 条
[1]  
[Anonymous], SNAKE GAME MOVEMENT
[2]  
Bohm N., 2005, P 6 MET INT C
[3]  
Cheng C.-Y., 2013, 27 ANN C JAP SOC ART
[4]   Using a genetic algorithm to tune first-person shooter bots [J].
Cole, N ;
Louis, SJ ;
Miles, C .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :139-145
[5]  
Ehlis T., 2000, APPL GENETIC PROGRAM
[6]  
Gallager M., P IEEE C EV COMP