CMU Artificial Intelligence Repository
GPQUICK: Simple GP system implemented in C++
areas/genetic/gp/systems/gpquick/
GPQUICK is a simple GP system implemented in C++. It features an
elegant object architecture with function (Function), program
(Chrome), GA (Pop) and problem (Problem) classes. The Problem class
is proposed as a portable representation for problems that would be
source compatible with a variety of other GP systems. GPQUICK uses a
steady state GA, tournament selection, one type of mutation, and
subtree crossover. It uses a fast, compact linear representation for
S-expressions. It includes documentation from the associated magazine
article (Byte, "Some Assembly Required", February 1994).
Origin:
ftp.cc.utexas.edu:/pub/genetic-programming/code/
as the files gpquick.tar (unix version, tested with CC and g++)
and gpquick.zip (PC/ANSI C version, tested with Borland 3.1).
Version: 2.1 (15-MAR-94)
Requires: C++
Copying: Copyright (c) 1993 by Andy Singleton
This code is released for non-commercial use only.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Andrew Singleton
Creation Mechanics, Inc.
PO Box 248, Peterborough, NH 03458
Tel: (603) 563-7757
Keywords:
Authors!Singleton, C++!Code, GPQUICK, Genetic Programming
References: ?
Last Web update on Mon Feb 13 10:23:27 1995
AI.Repository@cs.cmu.edu