Koza's 11-multiplexer: 3 address bits select one of 8 data bits, 2048 cases
4000 trees, until every case is right

Target after 15 generations and 51907 evaluations
cases right: 2048 of 2048

the function, 40 nodes of depth 5:
if(a0, if(a1, if(a0, if(a2, d7, d3), d2), if(a2, d5, if(a1, d2, if(a0, d1, d0)))), if(a2, if(a1, if(a1, if(a2, d6, d3), d1), d4), if(a1, d2, if(a0, d1, d0))))
