hacker.org

Woah, I posted a reply in the general puzzles forum (about the average case difficulty of Hamiltonian path finding being polynomial) not having checked this forum or the high scores. I knew my solver was very badly optimized, and it doesn't use all the possible tricks, but I'm still surprised by tha...

Actually, if you read up on the literature on Hamiltonian paths and cycles, you'll find that while it is NP-complete in the worst case, it is actually solvable in polynomial time on average for random graphs, at least for some definitions of what a random graph is. My own (current) solver is an only...

The numbers should be in hexadecimal. In this case you have some 10s where you should have As.

Don't be so sure no posts implies no interest ...

I also plan to make a bot for Wormageddon at some point. I already have one that heads straight right to hit the wall, but my standards before I submit are a bit higher than PhalanX's =)