Huge differences between people's level.

coderT · Post by **coderT** » Wed Dec 31, 2008 9:58 am

Just by doing brute force recursion won't even get you up to level 50, I think it's because there are so many choices each move, not just directions like in Runaway and Mortal coil.
Wonder how people got to 1000...

therethinker · Post by **therethinker** » Wed Dec 31, 2008 6:39 pm

By not doing brute-force

There are plenty of algorithms & heuristics that people can implement in order to speed things up

V4hn · Post by **V4hn** » Tue Aug 11, 2009 11:00 pm

Yeah, but at last it's a search for an hamiltonian path, which is an NP-complete Problem...
there _can't_ be an easy solution.

gfoot · Post by **gfoot** » Tue Aug 25, 2009 9:06 pm

The leaderboard says otherwise...

V4hn · Post by **V4hn** » Tue Sep 15, 2009 11:06 pm

I'm quite interested in whether those top level solutions exploit some specific
attribute of those given graphs or if they do challenge the typical hamiltonian path problem?

Nick-Aotmzgin · Post by **Nick-Aotmzgin** » Wed Sep 16, 2009 7:16 am

speak with an admin maybe the Statistica and ranking system has been damaged.

V4hn · Post by **V4hn** » Wed Sep 16, 2009 9:39 am

i'm quite sure they're not.

Zeta · Post by **Zeta** » Wed Sep 16, 2009 10:55 am

Welcome to the wonderful world of heuristic algorithms to tackle NP-complete problems: They may find a solution in acceptable time in the majority of cases, but if they don't find a solution you can't be sure if there isn't one at all, or only your algorithm failed. Here they work very well...