Modification of Pathfinding Algorithms for the Snake Game

Student: Kusakin Danil

Faculty: St. Petersburg School of Physics, Mathematics, and Computer Science

Educational Programme: Big Data Analysis for Business, Economy, and Society (Master)

Year of Graduation: 2020

In this project a new algorithm for a perfect Snake game was developed, it allows to get highest possible score and to fill the whole grid. This algorithm is based on hamiltonian cycle and shortcuts through the grid. To improved the approach even further the A* algorithm was integrated to propose bette shortcuts. Also a new way to generate hamiltonian path for large grids was applied.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses