# Take the Design Challenge!

Since posting my essay on Genetic Algorithms, I’ve since developed a brand-new C++ version of my Steiner Networks genetic algorithm, a vast improvement over the old Fortran number-clunker I developed five years ago.

And already, the new code is leading to some very interesting results.

In light of William Dembski’s remarks in No Free Lunch, basically arguing that in all Genetic Algorithms,

… the fitness function … is well-defined and readily supplies the complex specified information that an optimal crooked wire genetic antenna [or any other problem solved with Genetic Algorithms] seems to acquire for free,

I’m giving Intelligent Design proponents (and everyone else!) a chance to actually Design something!

As you recall, my algorithm involves finding Steiner Trees, the shortest networks of straight-line segments connecting a given collection of fixed points. These networks may include additional variable “Steiner Points” where segments may meet.

The Challenge Here is a collection of six fixed points. Designers, send your candidates for the Steiner Solution for this particular 6-point system to me at nmsrdaveATswcp.com (replace the AT with an @ if you please).

I will announce the winners (if any) in a week’s time, and also will present the answer that Evolution came up with. I’m interested in proposed solutions from any and all (you don’t have to be in the ID camp), but am especially interested in solutions by ID advocates, since y’all are saying that the solution is already implicitly defined in the statement of the problem (finding shortest connected networks).
Here’s a Hint:

 You can send solutions as images (GIF preferred), textual descriptions (e.g. “a point at 250,300 connected to a point at 350, 300”), plain text ( / \ _ ) or web pages.

This invitation is cordially extended to the entire Software Engineering Team at Uncommon Descent, where Salvador Cordova recently wrote

This is not the first time Thomas put together a sham. A few weeks back he put together a sham on evolutionary algorithms. After I visited pandas thumb to called him on his little charade Comment 111151 he suggested I leave. In the meantime, the blogsphere from PZ Myers onward hailed Dave’s little gimmick as some kind of truth. Most of the software engineers here at UD saw right through it, but the eager consumers of Panda food gulped it down uncritically, believing the design argument was refuted by his software theatrics. This last little bit of misrepresentation by Thomas is par for the course for the Panda bloggers.

Salvador, I didn’t “suggest you leave” never to comment again, but simply to spin up on the concepts (like Irreducible Complexity, No Free Lunch etc.) that were being discussed in that post. Your Input is now formally solicited.

This will be the first installment of a 3 part series where I will explore the work on evolutionary algorithms by Chris Adami, Dave Thomas, Wesley Elsberry, and Jeff Shallit.

He followed this by stating

I will also post on Dave Thomas’s evolutionary algorithms, but in brief, his disproof can be illustrated by this fictional scenario:

PZ Myers finds DaveScot in the park one day, walks up with a paint ball gun and shoots DaveScot in the chest. Ouch! Shortly before DaveScot confers a little retribution for this act, PZ pleads, “Don’t be mad Dave, you were not the target of my gun. Honest, I was aiming at the shirt you happen to be wearing, not at you specifically, only your shirt.”