The "best reward" is computed by finding the Euclidean distance between the closest bot to the reward (it's more like cost). The DNA strand consists of 500 angles, and the step size is 5 pixels.
-
Updated
Jan 4, 2022 - C
The "best reward" is computed by finding the Euclidean distance between the closest bot to the reward (it's more like cost). The DNA strand consists of 500 angles, and the step size is 5 pixels.
An Evolutionary Artificial Neural Network implemented in Rust designed to learn and play the Snake game.
Add a description, image, and links to the eann topic page so that developers can more easily learn about it.
To associate your repository with the eann topic, visit your repo's landing page and select "manage topics."