hacker.org

My not optimized Implementation of http://www.cv-foundation.org/openaccess/content_cvpr_2013/papers/Sholomon_A_Genetic_Algorithm-Based_2013_CVPR_paper.pdf solves the Challenge in under 2 Hours. I implemented a variation of that algorithm at http://webee.technion.ac.il/~ayellet/Ps/15-PT.pdf . It als...

Some kind of insertion sort, 1130 cycles for the best case and 5210 for the worst case. 0@s\@=@=@=@=,1vxs/01^<1^x?\3[s/1+$ s /02^>==/ 1 | /==P\ \>v40\ - [ 1 * /=:^1^1<^20v1/ 4 v 4 \s\==============/ p + 1 6 - 5 \01^:!

Did it in bash, character walks around randomly but descends only if the difference between character and dungeon level is high enough. It also implements potion management (2 aquamarine and 1 not-aquamarine) and picking up the strongest weapon. Potions are used if HP reaches 1/3 or 2/3 of maximum H...