En op 03 juli 2002 sprak Steffen Mueller:
<snip>
> This really isn't a new rule, I think. The rules never stated that your
> entry isn't supposed to work on a very large number of nodes. In fact, we
> deliberately did not limit the number of nodes. Hence, we cannot allow
> hardcoded limits.
What do you mean by hardcoded limits? Code like 'if($x++>100){exit}'?
Would 'if($x++>$^T){exit}' be OK? Would using the stash size as a limit
be OK, as someone did in the Cantor/Kolakoski match?
Or is any arbitrary limit of your algorithm a reason for rejection?
Every algorithm has its limits, if only because of the given memory
usage and running time limits.
Talking about the time limit, it is vague, not in the spirit of what you
wrote above, and not applied correctly. One of my entries was not tested
on Rick's "nice and slow 200Mhz machine", but on two other ones, which
presumably are better, newer, faster. I don't think this rejection was
fair.
(-ugene
This is a work of fiction. All the code portrayed in this mail is
fictional, and any resemblance to real golf or production code is purely
coincidental.
--
Brevity is the soul of wit. -- \\/illiam _/`hakespeare
