Winner Yi Cao (Buy a ticket)
| Date | Submission | Comment |
|---|---|---|
| 2007-05-09 13:17:03 UTC |
silly test v1 by petey torrione |
prelim test...
by petey torrione |
| 2007-05-09 13:19:03 UTC |
silly test v2 by petey torrione |
try #2... firewall issue?
by petey torrione |
| 2007-05-09 15:16:49 UTC |
Why Not? by Nick Howe |
Incorporates coordinate swap.
by Nick Howe |
| 2007-05-09 15:26:10 UTC |
silly test v3 by petey torrione |
recurse level = 2;
by petey torrione |
| 2007-05-09 15:31:15 UTC |
maybe worse by Mike Bindschadler |
on the testsuite, this one actually did worse than the contest team
by Mike Bindschadler |
| 2007-05-09 15:33:16 UTC |
stopme by Mike Bindschadler |
unsophisticated stopping if the score isn't going to improve this move, only slightly better than the contest team entry
by Mike Bindschadler |
| 2007-05-09 15:55:31 UTC |
APBstLp- by Alex P. |
-scr
by Alex P. |
| 2007-05-09 16:27:08 UTC |
Starting a history by Alan Chalker |
Note in the interest of collaboration I'm documenting
the code as much as possible. Instead of going the obscufation route with this, I invite everyone to document / take credit for their particular changes as the codes get modified AC - Ala by Alan Chalker |
| 2007-05-09 16:27:08 UTC |
Starting a history by Alan Chalker |
n Chalker
CT - Contest Team by Alan Chalker |
| 2007-05-09 16:34:24 UTC |
myopic (2) depth (3) by petey torrione |
myopic (2) / depth first search (3)
big & clunky by petey torrione |
| 2007-05-09 16:48:55 UTC |
myopic(2) depth(3) *100 by petey torrione |
try looking longer; will this break the 3 minute barrier?
by petey torrione |
| 2007-05-09 17:09:19 UTC |
LocalMinimum by Yi Cao |
Grade function has a bug
by Yi Cao |
| 2007-05-09 17:10:16 UTC |
myopic(2) depth(3) *20 (looking less deep) by petey torrione |
Myopic depth first search; looks less deep
by petey torrione |
| 2007-05-09 18:03:11 UTC |
SecondEntry by Some idiot |
Does this work?
by Some idiot |
| 2007-05-09 18:23:24 UTC |
disterbbi2 by John Solar |
Apologies to Dr. Viterrbi. Now make this recursive to some reasonable Vitterbi length.
by John Solar |
| 2007-05-09 20:21:02 UTC |
Shitty by Some idiot |
It work!
by Some idiot |
| 2007-05-09 20:38:42 UTC |
myopic 2, depth 2, n 50 by petey torrione |
Goes in under 180 seconds, barely, on my machine
by petey torrione |
| 2007-05-09 20:40:47 UTC |
myopic 2, depth 2, n 50, Breakout - 4 by petey torrione |
Include code for running deeper searches when no moves are found...
by petey torrione |
| 2007-05-09 21:45:44 UTC |
Rec: 2, break through 6, myopic [3 1], N = 100 by petey torrione |
Rec: 2, break through 6, myopic [3 1], N = 100...
by petey torrione |
| 2007-05-09 22:13:10 UTC |
Max dIFF by Some idiot |
This is much better
by Some idiot |
| 2007-05-09 22:21:18 UTC |
Darkness Call by JM Team |
Depth-1, Best Score, Mean-Max Threshold.
by JM Team |
| 2007-05-09 23:05:07 UTC |
fixed convoluted darkness by David |
just noticed the sample code was fixed ...
by David |
| 2007-05-09 23:05:53 UTC |
fixed vectorized darkness by David |
just noticed the sample code was fixed ...
by David |
| 2007-05-09 23:21:46 UTC |
Making subfunctions by Alan Chalker |
% Note in the interest of collaboration I'm documenting
% the code as much as possible. Instead of going the % obscufation route with this, I invite everyone to % document / take credit for their particular changes % as the codes get modified by Alan Chalker |
| 2007-05-09 23:46:01 UTC |
firstProg by Kangsheng LUO |
Each step select the maximum score one to eliminate, similar to greedy algorithm, may be improved later,:-)
by Kangsheng LUO |