| Date | Submission | Comment |
|---|---|---|
| 2007-11-14 11:03:46 UTC |
Ulriks V3 by Ulrik Kjems |
add check on no improvement
by Ulrik Kjems |
| 2007-11-14 10:55:16 UTC |
Ulriks V2 by Ulrik Kjems |
Second go, I forgot to include the splice.m function
by Ulrik Kjems |
| 2007-11-14 10:33:35 UTC |
UlriksV1 by Ulrik Kjems |
First shot!
by Ulrik Kjems |
| 2007-11-14 10:32:53 UTC |
time Test resubmitted by Marc Lätzel |
Cobus Potgieter & Hannes Naud
by Marc Lätzel |
| 2007-11-14 09:46:40 UTC |
Anti-obfuscation by Abhisek Ukil |
Can obfuscation really hide originality?
by Abhisek Ukil |
| 2007-11-14 09:32:40 UTC |
Outlaw RAND or force a seed by DrSeuss |
function Iav = solver(CYQ,DgS,WRh), EN1 = 2;if WRh > EN1, Iav = G_J(CYQ,DgS,WRh-EN1);WBQ = Al1(doMoves(CYQ,Iav,length(CYQ)),DgS,WRh-size(Iav,1));
AyD = C13(doMoves(CYQ,Iav,length(CYQ)),DgS,WRh-size(Iav,1),WBQ);O3X = Cts(doMoves(CYQ,Iav,length(CYQ)), by DrSeuss |
| 2007-11-14 09:32:40 UTC |
Outlaw RAND or force a seed by DrSeuss |
DgS,WRh-size(Iav,1));
YFA = C13(doMoves(CYQ,Iav,length(CYQ)),DgS,WRh-size(Iav,1),O3X);if YFA<AyD,WBQ = O3X; end Iav = [Iav; WBQ];else, Iav = U4u(CYQ,DgS,WRh); end function [Iav,Bfq] = RLh(CYQ,DgS,WRh,To3), Iav = zeros(WRh,4);USa=numel(CYQ);DOl=z by DrSeuss |
| 2007-11-14 09:28:11 UTC |
For rand('seed',someval) for all contests by DrSeuss |
function OTT = solver(NS2,D3Y,Yiy), KGN = 2;if Yiy > KGN, OTT = TCQ(NS2,D3Y,Yiy-KGN);DHY = LN2(doMoves(NS2,OTT,length(NS2)),D3Y,Yiy-size(OTT,1));
FwP = Eu2(doMoves(NS2,OTT,length(NS2)),D3Y,Yiy-size(OTT,1),DHY);QAh = RZ0(doMoves(NS2,OTT,length(NS2)), by DrSeuss |
| 2007-11-14 09:28:11 UTC |
For rand('seed',someval) for all contests by DrSeuss |
D3Y,Yiy-size(OTT,1));
Ezu = Eu2(doMoves(NS2,OTT,length(NS2)),D3Y,Yiy-size(OTT,1),QAh);if Ezu<FwP,DHY = QAh; end OTT = [OTT; DHY];else, OTT = RPS(NS2,D3Y,Yiy); end function [OTT,Btm] = ZY4(NS2,D3Y,Yiy,GRO), OTT = zeros(Yiy,4);NP3=numel(NS2);JWk=z by DrSeuss |
| 2007-11-14 09:23:19 UTC |
beat obfuscation by Jack Snoeyink |
Maybe the way to combat obfuscators is to make mods to beat them with their own code...
by Jack Snoeyink |
| 2007-11-14 08:56:04 UTC |
faz00a by Fernando |
Just playing
by Fernando |
| 2007-11-14 07:14:56 UTC |
del reves by Josete |
last = 2;
if budget > last mv = oldconvolutedsolver(sequ,target,budget-last); mv2 = new2solver(domv(sequ,mv,length(sequ)),target,budget-size(mv,1)); score2 = findscore(domv(sequ,mv,length(sequ)),target,budget-size(mv,1),mv2); mv3 by Josete |
| 2007-11-14 07:14:56 UTC |
del reves by Josete |
= anothersolver(domv(sequ,mv,length(sequ)),target,budget-size(mv,1));
score3 = findscore(domv(sequ,mv,length(sequ)),target,budget-size(mv,1),mv3); if score3<score2, mv2 = mv3; end mv = [mv; mv2]; else mv = markusso by Josete |
| 2007-11-13 15:50:22 UTC |
LAST_PLACE_CASH_PRIZE by Nick Clark |
Deliberate attempt to loose badly!
by Nick Clark |
| 2007-11-13 11:19:53 UTC |
faz00 by Fernando |
Just a small tiny test to see how this web page works.
by Fernando |
| 2007-11-13 07:38:54 UTC |
ukil --> greedy by Jack Snoeyink |
change one of the ukil solvers to my greedy implementation
by Jack Snoeyink |
| 2007-11-12 20:25:31 UTC |
Fast Deutsch11 by Abhisek Ukil |
Obfuscated Unwanted !!
by Abhisek Ukil |
| 2007-11-12 19:14:29 UTC |
erm12 by nathan |
go raibh maith agat, Markus...
by nathan |
| 2007-11-12 19:13:50 UTC |
erm11 by nathan |
go raibh maith agat, Markus...
by nathan |
| 2007-11-12 19:06:19 UTC |
erm9 by nathan |
with thanks to Markus...
by nathan |
| 2007-11-12 18:38:50 UTC |
pixies 4.1 by nathan |
Be kind to be, test suite pixies...
by nathan |
| 2007-11-12 12:17:08 UTC |
Hmmm by nathan |
So the same code might get a different score now... right?
by nathan |
| 2007-11-12 09:52:31 UTC |
Give in to mse by Ulf Schwurack |
New idea, little improvement again...
by Ulf Schwurack |
| 2007-11-12 07:23:43 UTC |
little by little by Ulf Schwurack |
Another little improvement...
by Ulf Schwurack |
| 2007-11-11 15:00:27 UTC |
if at first you don't succeed by Hannes Naudé |
Just keep doing your best.
by Hannes Naudé |