mateusz512 / fuzzysnake Goto Github PK

The excelent code review has been made by @Mateusz512 , so the updated code should follow those guidelines.

For a very long snake, it may be beneficial to move with BFS along predefined points instead of straight to the apple, to ensure it will be able to cover the maximum amount of tiles repeatedly

A smart algorithm should calculate the area of enclosed tiles and prevent the snake from entering small loops

The snake should be able to go through its last tile, as it will be empty by the time snake gets there.

The project may need a presentation or documentation