hacker.org Forum Index
RegisterSearchFAQMemberlistUsergroupsLog in
Huge differences between people's level.

 
Reply to topic    hacker.org Forum Index » OneOfUs View previous topic
View next topic
Huge differences between people's level.
Author Message
coderT



Joined: 12 Nov 2008
Posts: 17

Post Huge differences between people's level. Reply with quote
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... Shocked
Wed Dec 31, 2008 9:58 am View user's profile Send private message Yahoo Messenger
therethinker



Joined: 28 Mar 2008
Posts: 144
Location: #hacker.org on Freenode

Post Reply with quote
By not doing brute-force Wink

There are plenty of algorithms & heuristics that people can implement in order to speed things up Wink
Wed Dec 31, 2008 6:39 pm View user's profile Send private message AIM Address
V4hn



Joined: 27 Nov 2007
Posts: 14

Post Reply with quote
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 View user's profile Send private message Visit poster's website
gfoot



Joined: 05 Sep 2007
Posts: 269
Location: Brighton, UK

Post Reply with quote
The leaderboard says otherwise...
Tue Aug 25, 2009 9:06 pm View user's profile Send private message
V4hn



Joined: 27 Nov 2007
Posts: 14

Post Reply with quote
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 View user's profile Send private message Visit poster's website
Nick-Aotmzgin



Joined: 14 Jun 2009
Posts: 64
Location: Microsoft Labs

Post Reply with quote
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 View user's profile Send private message
V4hn



Joined: 27 Nov 2007
Posts: 14

Post Reply with quote
i'm quite sure they're not. Laughing

_________________
Wed Sep 16, 2009 9:39 am View user's profile Send private message Visit poster's website
Zeta



Joined: 16 Apr 2009
Posts: 62

Post Reply with quote
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 View user's profile Send private message
Display posts from previous:    
Reply to topic    hacker.org Forum Index » OneOfUs All times are GMT
Page 1 of 1

 
Jump to: 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum


Powered by phpBB © 2001, 2005 phpBB Group
Design by Freestyle XL / Flowers Online.