New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Ramped-half-and-half: full and grown trees #2

Open

emgrasmeder opened this issue Aug 6, 2018 · 0 comments

Labels

Owner

emgrasmeder commented Aug 6, 2018 •

edited

Loading

The enhancement on the table is to use Koza's "ramped half and half" algorithm to create trees.

A "full" tree is a tree such that every path has a depth equal to the maximum tree depth
A "grown" tree is a tree such that every path has a depth less than or equal to the maximum depth of a tree
Koza's ramped-half-and-half method produces a set of graphs with a uniform distribution of maximum depths, and for each max-depth, a uniform number of graphs are "full" and "grown".

emgrasmeder added the enhancement label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment