| Author |
Message |
coderT
Joined: 12 Nov 2008
Posts: 17
|
|
 Huge differences between people's level. |
 |
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... 
|
|
| Wed Dec 31, 2008 9:58 am |
   |
 |
therethinker
Joined: 28 Mar 2008
Posts: 144
Location: #hacker.org on Freenode |
|
| |
|
By not doing brute-force 
There are plenty of algorithms & heuristics that people can implement in order to speed things up
|
|
| Wed Dec 31, 2008 6:39 pm |
 |
|
V4hn
Joined: 27 Nov 2007
Posts: 14
|
|
| |
|
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.
_________________
 |
|
| Tue Aug 11, 2009 11:00 pm |
 |
|
gfoot
Joined: 05 Sep 2007
Posts: 269
Location: Brighton, UK |
|
| |
|
The leaderboard says otherwise...
|
|
| Tue Aug 25, 2009 9:06 pm |
|
|
V4hn
Joined: 27 Nov 2007
Posts: 14
|
|
| |
|
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?
_________________
|
|
| Tue Sep 15, 2009 11:06 pm |
|
|
Nick-Aotmzgin
Joined: 14 Jun 2009
Posts: 64
Location: Microsoft Labs |
|
| |
|
speak with an admin maybe the Statistica and ranking system has been damaged.
_________________
(i) Hacerks Group -> Greek Hackers Group (House of Hackers Offical Community) |
|
| Wed Sep 16, 2009 7:16 am |
|
|
V4hn
Joined: 27 Nov 2007
Posts: 14
|
|
| |
|
i'm quite sure they're not. 
_________________
|
|
| Wed Sep 16, 2009 9:39 am |
|
|
Zeta
Joined: 16 Apr 2009
Posts: 62
|
|
| |
|
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...
|
|
| Wed Sep 16, 2009 10:55 am |
|
|
|
