How do I get started with monkeys for genetic programming in Python?

Install monkeys via 'pip install monkeys' and follow the interactive Jupyter notebooks provided in the repository, such as 'Getting started with monkeys.ipynb', which walk you through the type system and basic usage with examples.

What are some practical examples of using monkeys?

monkeys can be used for generating linting rules from code examples, solving logic puzzles, evolving game AI, and automated code repair, as shown in the sample notebooks like 'Linting by example' and referenced research papers on antenna design or quantum algorithms.

How does monkeys compare to DEAP for evolutionary algorithms?

monkeys focuses specifically on strongly-typed genetic programming with an emphasis on accessibility and ease of use, while DEAP is a more general-purpose evolutionary computation framework with broader features but a steeper learning curve and less type enforcement.

How to define a custom fitness function in monkeys?

In monkeys, you specify a scoring method by defining a Python function that evaluates the merit of solutions based on problem-specific criteria, as demonstrated in tutorials where fitness is tied to outcomes like puzzle solving or code correctness.

Is monkeys good for beginners in genetic programming?

While monkeys aims to be accessible with its tutorials, it requires understanding of genetic programming concepts and Python, so it's best for developers with some background in algorithms or AI experimentation, not complete novices.

Can monkeys handle real-time applications?

Due to the iterative and computationally intensive nature of genetic programming, monkeys is not ideal for real-time applications where quick responses are needed; it's better suited for offline optimization, research, and exploratory tasks.

Open-Awesome

monkeys

Python

A strongly-typed genetic programming framework for Python that makes evolutionary algorithms accessible and fun.

GitHub

124 stars14 forks0 contributors

What is monkeys?

monkeys is a strongly-typed genetic programming framework for Python that represents solutions as executable tree structures. It allows users to specify solution forms and scoring methods, enabling intelligent search through potential programs to solve problems like game AI, bug repair, and algorithm design.

Target Audience

Python developers and researchers interested in evolutionary algorithms, genetic programming, automated problem-solving, or AI experimentation who want a flexible and accessible toolkit.

Value Proposition

Developers choose monkeys for its strong typing system that simplifies program structure specification, its ease of use with comprehensive tutorials, and its applicability to a wide range of domains from academic research to practical AI solutions.

Overview

A strongly-typed genetic programming framework for Python

Use Cases

Best For

Experimenting with genetic programming concepts in Python
Generating programs or rules from examples (e.g., linting rules)
Solving logic puzzles or optimization problems algorithmically
Researching evolutionary algorithms and program synthesis
Creating game AI or adaptive systems via evolutionary methods
Automated debugging or code repair through program evolution

Not Ideal For

Projects requiring real-time or low-latency AI solutions, as genetic programming's iterative evolution can be computationally slow.
Teams looking for pre-built machine learning models without custom problem specification, since monkeys requires defining solution structures and scoring functions.
Environments not based on Python, as it is a Python-exclusive framework.

Pros & Cons

Pros

Strong Typing System

Implements strongly-typed genetic programming, allowing easy specification of program structures and constraints, as highlighted in the README's description of the variant used.

Accessible Setup and Learning

Offers quick installation via pip and comprehensive Jupyter notebook tutorials, making it easy to start experimenting with genetic programming without extensive configuration.

Broad Problem Applicability

Applicable to diverse domains from game AI to code repair, demonstrated through examples like linting by example and logic puzzle solving in the provided notebooks.

Python Version Compatibility

Supports both Python 2.7 and 3.x, ensuring it can be used in a wide range of Python environments, as noted in the features.

Cons

High Computational Overhead

Genetic programming involves evaluating populations of programs iteratively, which can be resource-intensive and slow for complex problems, limiting use in performance-critical scenarios.

Manual Configuration Burden

Users must define all aspects of the problem, including types and fitness functions, which can be time-consuming and require deep domain knowledge, unlike plug-and-play AI tools.

Niche Community and Ecosystem

Compared to mainstream AI libraries, monkeys has a smaller community, which may limit available resources, third-party integrations, and support for troubleshooting.

Frequently Asked Questions

Related Projects

deap

Distributed Evolutionary Algorithms in Python

Stars6,424

Forks1,164

Last commit3 months ago

PyGAD

Source code of PyGAD, a Python 3 library for building the genetic algorithm and training machine learning algorithms (Keras & PyTorch).

Stars2,213

Forks499

Last commit15 days ago

Genetic Programming in Python (GitHub)

Genetic Programming in Python, with a scikit-learn inspired API

Stars1,871

Forks323

Last commit6 months ago

sklearn-genetic

Genetic feature selection module for scikit-learn

Stars327

Forks75

Last commit2 years ago

Community-curated · Updated weekly · 100% open source

Found a gem we're missing?

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

Submit a project Star on GitHub