I Built a Highly Optimized Snake Game: AI and Custom Board and Custom Speed (Just 869KB)

Project: Snake — AI Robust v2
This project is an advanced implementation of the classic Snake game, enhanced with a powerful, multi-strategy artificial intelligence system. The project is developed in Rust using the Macroquad graphics library. The primary goal of this application is to showcase the AI's ability to play effectively through strategic planning, not just by following the shortest path.

Key Features
Advanced AI: The AI implements complex algorithms to ensure the snake's survival for the longest possible duration.

Comprehensive Customization Options: The player can significantly modify the game's behavior, including board size, speed mode, and wall-wrapping behavior.

Multiple Play Modes: The game can be played manually or with AI assistance, with the option to visualize the planned path.

Multiple Visual Themes: The project provides three distinct visual themes (Classic, Modern, Pixel) for a personalized gaming experience.

Modern Graphics: The game includes particles and visual effects to enrich the experience.

Integrated AI Analysis
The AI in this project relies on a hybrid approach to ensure it achieves its primary goals: eating food, avoiding collisions, and guaranteeing survival.

Eating Strategy:

The AI uses the A* (A-Star) algorithm to find the shortest possible path from the snake's head to the food's location.

After finding a path, the system performs a safety check: Will following this path trap the snake in a confined space? This is verified by calculating the number of reachable cells after the path is executed. If the available space is less than the new snake's length, the path is deemed unsafe.

Survival Strategy:

If the shortest path to the food is unsafe, the AI switches to a survival strategy.

First Option: It searches for the shortest path to the snake's tail using the A* algorithm. This ensures the snake remains alive by moving towards a safe, open area.

Second Option: If the previous strategy fails, the AI chooses the next move that leads to the largest reachable free space. This prevents the snake from getting trapped in corners.

Fallback Strategies:

Hamiltonian Path Algorithm: In the absence of a safe path to the food or tail, the AI can use a Hamiltonian path (a cycle that visits every cell on the board exactly once) as a last resort to ensure indefinite survival.

Safe Random Move: As a final solution, the AI will choose a random move from the available options that does not lead to an immediate collision

How to get the application?
Open the link in the comments and you will be redirected to Google Drive. Go to Target, then Release, and you will find the executable file for the game. You can download it and enjoy the game

Видео I Built a Highly Optimized Snake Game: AI and Custom Board and Custom Speed (Just 869KB) канала Reyw'a