This paper solves the problem of looking for the best strategy in the Snake game that would ensure the best result. The problem is that there are countless possible strategies, with each having its strengths and weaknesses. To solve the problem, the basic Snake game was first created. After that, various artificial intelligence algorithms were created and implemented, with each using its own strategy. When the game was functional, algorithms were created one after another. Results are compared in terms of snake length, number of moves and number of tries.
|