Snake Game with NEAT AI
Watch ANNs evolve to play Snake using the NEAT algorithm
How it works
This simulation uses NEAT (NeuroEvolution of Augmenting Topologies) to evolve neural networks that play Snake.
Inputs (11 total):
- Immediate obstacles (wall or tail) in front, left, and right (3 binary inputs)
- Distance to nearest tail segment in front, left, and right (3 normalized inputs, 1/distance)
- Food position relative to snake head (2 binary inputs: food right?, food below?)
- Current direction one-hot encoded (3 inputs for Up, Right, Down; Left is implicit)
Outputs (3): The network decides whether to go straight, turn left, or turn right.
Current Test Genome
Score:
0
Evolution Statistics
Generation:
0
Best Fitness:
0
Best Score:
0
Average Fitness:
0
Species Count:
0
Max Moves Without Food:
100