So, someone else here using an genetic algorithm to try and make programs here. Well... a long time ago, I wrote an BF Joust evolver for an ongoing hill in an IRC channel. I decided to give it a spin for this contest as well~

And... unlike the other person with an evolver, I evolved all of mine from a single common program. :)

(>[-])*10000 

NestDarwin (Generation 309)

This is the best result my evolver has come up with so far. I'm not sure how much the nested structure helps in this case, but, structures like this was what the evolver is meant to be able to do. Expected performance on the 27.08.2014 hill is 474 points. (Calculated by running the battle on all 21 tape lengths, and multiplying by 10/21. Note that this isn't normalized for the fact that this hill has one extra program on it)

(-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--)*10000)*10000)*10000)*10000)*10000)*10000)*10000 

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

EDIT 2: I went and manually analyzed the evolver's output. Despite looking very different, NestDarwin is basically an optimized version of TinyDarwin... Manually minimized (with identical functionality) and analyzed:

(-)*5 Break stuff that assumes flag size. (>[(-)*8[.+]](-)*7)*3 Make a few larger decoys next to our flag. The clear loop is basically dead code here. Few things are going to approach so fast, so. (>[(-)*8[.+]](-)*2)*10000 And go on an rampage with an offset clear! I presume the slow clear is to beat tripwires. 

So, an almost identical program would be as follows... which is basically a super-optimized version of TinyDarwin.

(-)*5(>.(-)*7)*3(>[(-)*8[.+]](-)*2)*10000 

TinyDarwin was as follows. Not very different, hun? I'm just going to withdraw it from the hill. I thought it was distinct, but... well, I was wrong.

((-)*5>[(-)*4.[+.]].)*10000 

So, someone else here using an genetic algorithm to try and make programs here. Well... a long time ago, I wrote an BF Joust evolver for an ongoing hill in an IRC channel. I decided to give it a spin for this contest as well~

And... unlike the other person with an evolver, my evolver can actually change more of the program more than repeat counts. :)

NestDarwin (Generation 309)

This is the best result my evolver has come up with so far. I'm not sure how much the nested structure helps in this case, but, structures like this was what the evolver is meant to be able to do. Expected performance on the 27.08.2014 hill is 474 points. (Calculated by running the battle on all 21 tape lengths, and multiplying by 10/21. Note that this isn't normalized for the fact that this hill has one extra program on it)

(-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--)*10000)*10000)*10000)*10000)*10000)*10000)*10000 

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

EDIT 2: I went and manually analyzed the evolver's output. Despite looking very different, NestDarwin is basically an optimized version of TinyDarwin... Manually minimized (with identical functionality) and analyzed:

(-)*5 Break stuff that assumes flag size. (>[(-)*8[.+]](-)*7)*3 Make a few larger decoys next to our flag. The clear loop is basically dead code here. Few things are going to approach so fast, so. (>[(-)*8[.+]](-)*2)*10000 And go on an rampage with an offset clear! I presume the slow clear is to beat tripwires. 

So, an almost identical program would be as follows... which is basically a super-optimized version of TinyDarwin.

(-)*5(>.(-)*7)*3(>[(-)*8[.+]](-)*2)*10000 

TinyDarwin was as follows. Not very different, hun? I'm just going to withdraw it from the hill. I thought it was distinct, but... well, I was wrong.

((-)*5>[(-)*4.[+.]].)*10000 

It's become apparent that the current hill isn't strong enough to allow it to evolve much more complex things. :(

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

TinyDarwin (Generation 41)

This was a particularly interesting one for its simplicity. I'm entering this just because I wanna see how well something so short can do. Has an expected score of 455 points.

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

EDIT 2: I went and manually analyzed the evolver's output. Despite looking very different, NestDarwin is basically an optimized version of TinyDarwin... Manually minimized (with identical functionality) and analyzed:

(-)*5 Break stuff that assumes flag size. (>[(-)*8[.+]](-)*7)*3 Make a few larger decoys next to our flag. The clear loop is basically dead code here. Few things are going to approach so fast, so. (>[(-)*8[.+]](-)*2)*10000 And go on an rampage with an offset clear! I presume the slow clear is to beat tripwires. 

So, an almost identical program would be as follows... which is basically a super-optimized version of TinyDarwin.

(-)*5(>.(-)*7)*3(>[(-)*8[.+]](-)*2)*10000 

TinyDarwin was as follows. Not very different, hun? I'm just going to withdraw it from the hill. I thought it was distinct, but... well, I was wrong.

So, someone else here using an genetic algorithm to try and make programs here. Well... a long time ago, I wrote an BF Joust evolver for an ongoing hill in an IRC channel. I decided to give it a spin for this contest as well~

And... unlike the other person with an evolver, I evolved all of mine from a single common program. :)

(>[-])*10000 

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

NestDarwin (Generation 309)

This is the best result my evolver has come up with so far. I'm not sure how much the nested structure helps in this case, but, structures like this was what the evolver is meant to be able to do. Expected performance on the 27.08.2014 hill is 474 points. (calculated by running the battle on all 21 tape lengths, and multiplying by 10/21)

(-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--)*10000)*10000)*10000)*10000)*10000)*10000)*10000 

TinyDarwin (Generation 41)

This was a particularly interesting one for its simplicity. I'm entering this just because I wanna see how well something so short can do. Has an expected score of 455 points.

((-)*5>[(-)*4.[+.]].)*10000 

So, someone else here using an genetic algorithm to try and make programs here. Well... a long time ago, I wrote an BF Joust evolver for an ongoing hill in an IRC channel. I decided to give it a spin for this contest as well~

And... unlike the other person with an evolver, I evolved all of mine from a single common program. :)

(>[-])*10000 

EDIT: Changed list of programs I wanna enter into this hill. Ran evolver overnight. :)

NestDarwin (Generation 309)

This is the best result my evolver has come up with so far. I'm not sure how much the nested structure helps in this case, but, structures like this was what the evolver is meant to be able to do. Expected performance on the 27.08.2014 hill is 474 points. (Calculated by running the battle on all 21 tape lengths, and multiplying by 10/21. Note that this isn't normalized for the fact that this hill has one extra program on it)

(-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--((-)*5(>[(-)*4----[.+]]--)*10000)*10000)*10000)*10000)*10000)*10000)*10000 

TinyDarwin (Generation 41)

This was a particularly interesting one for its simplicity. I'm entering this just because I wanna see how well something so short can do. Has an expected score of 455 points.

((-)*5>[(-)*4.[+.]].)*10000