NEAT C++ for Microsoft Windows
Released 2002
The Windows NEAT package contains C++ source code for the NeuroEvolution of Augmenting Topologies method (see the original NEAT package above). It includes an animated demo task and a precompiled executable that runs under Windows. The included task is a minesweeper problem in which sweepers have to cover as much area as possible in a finite amount of time (see screenshot ).

For answers to common questions, refer to our FAQ .

Windows NEAT was written by Mat Buckland, based on the NEAT method by Kenneth Stanley. Please direct bug reports to fup@btinternet.com. Please contact kstanley@cs.utexas.edu for other comments, including ideas or plans for expanding the open source software.

Versions:
v1.0 9/7/02 buckland

Download:
ZIP
Kenneth Stanley Postdoctoral Alumni kstanley [at] cs ucf edu
Neuroevolution Risto Miikkulainen In Encyclopedia of Machine Learning, New York, 2010. Springer. 2010

Competitive Coevolution through Evolutionary Complexification Kenneth O. Stanley and Risto Miikkulainen Journal of Artificial Intelligence Research, 21:63-100, 2004. 2004

Evolving a Roving Eye for Go Kenneth O. Stanley and Risto Miikkulainen In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), Berlin, 2... 2004

Continual Coevolution Through Complexification Kenneth O. Stanley and Risto Miikkulainen In William B. Langdon and Erick Cantu-Paz and Keith E. Mathias and Rajkumar Roy and David Davis and ... 2002

Efficient Evolution Of Neural Network Topologies Kenneth O. Stanley and Risto Miikkulainen In William B. Langdon and Erick Cantu-Paz and Keith E. Mathias and Rajkumar Roy and David Davis and ... 2002

Efficient Reinforcement Learning Through Evolving Neural Network Topologies Kenneth O. Stanley and Risto Miikkulainen In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), 9, San Fr... 2002

Evolving Neural Networks Through Augmenting Topologies Kenneth O. Stanley and Risto Miikkulainen Evolutionary Computation, 10(2):99-127, 2002. 2002