From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Reduce adv to darkness winner
Date: Fri, 7 Nov 2008 19:33:01 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 16
Message-ID: <gf255d$7au$>
References: <ger09l$7v0$> <gesrql$476$> <> <gevfju$q8d$> <gevpki$bt2$> <gf04fe$1fo$> <gf0701$k88$> <gf0hn7$jbn$> <gf10n5$act$> <gf1ghf$3ea$> <gf21bi$fsi$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: 1226086381 7518 (7 Nov 2008 19:33:01 GMT)
NNTP-Posting-Date: Fri, 7 Nov 2008 19:33:01 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1176925
Xref: comp.soft-sys.matlab:499576

> 1. Well given that we already know the shortest amount of time is never going to drop below about 70s due to the 'overhead' caused by the contest machinery, it will always be better to work on faster code than to work on a better result, unless there is some major algorithmic breakthrough.  

Thanx Alan for your insight into the param. well, I also recognized the point of making faster code. I tried in that direction, but the result got worse. So kind of dilemma. 
Nevertheless, it was a unique experience to fight against an unknown enemy. This goes towards promoting robust generalized codes. 

To contest team, a potential suggestion to reduce the advantage of the darkness winner in twilight phase, one can choose the darkness winner entry and any other good entry which is not disclosed. Then, you can simply combine them as follows to create new enemy

if rand<0.5, 
   run darkness winner
  run undisclosed good entry