A* Searching for Snake Game

This project implements the A* pathfinding and BFS algorithm in a classic snake game. The algorithm calculates the shortest path to the target (apple) while avoiding obstacles, including its own body. when there is no possible paths to target is returned, snake takes a 'survival mode' as an algorithm, which basically tries to wander around inside safe boundaries.

Features

• A * Searching Algorithm
• BFS Algorithm

Demo

Getting Started

Prerequisites

• C++ compiler (C++14 or later)

Installation

git clone https://github.com/Cerealmaster0621/SnakeGame_A-search.git
cd SnakeGame_A-search
chmod +x snake.py
./snake.py run snake_bfs.cpp

or...

> With `./snake.py --help`
> you can see various commands that you can use.

Copyleft / End User License

• MIT

This project is licensed under the terms of the MIT license.

Acknowledgments

Contact For any queries or feedback, please contact YoungJune Kang at [email protected].