| Author |
Message |
bamilan
Joined: 05 Aug 2007
Posts: 2
|
|
|
| Tue Feb 17, 2009 9:57 pm |
  |
 |
MerickOWA
Joined: 07 Apr 2008
Posts: 182
Location: HkRkoz al KuwaiT 2019 HaCkEr 101 |
|
 |
 |
Don't put the <>'s in the URL. Also make sure you're doing proper URL escaping of characters if your password has anything unusual in it (punctuation, spaces, etc).
Other than that the url looks ok, thats how I did it for my solution.
|
|
| Wed Feb 18, 2009 2:11 pm |
|
|
jonik555
Joined: 31 Aug 2009
Posts: 43
Location: Prague |
|
| |
|
Really Nice puzzle! Finally solved it 
I'm little bit sad of that High scores are ordered by time of solve...
It would be nice to somehow measure time to solve from solving first lvl first time to last one...
I'm so happy!!! I haven't sleeped this night (debug,debug,debug...)
I wonder which puzzle is good to try next... every of them seems to be too hard for me...
Any ideas?
Thank You for hacker.org
_________________
There are 10 types of people, those who understand ternary, those who think that this joke is about binary and the others. |
|
| Sun Aug 15, 2010 5:49 pm |
|
|
CodeX
Joined: 17 Oct 2008
Posts: 350
|
|
| |
|
I think OneOfUs is probably a good one to move onto next, my basis for that is that it's what I'm doing  Also it would be pretty hard to gauge peoples solver speeds as the solvers can be so fast, like 0.005s or less, you'd end up gauging people's latencies to the web server more than the efficiency of their solver.
|
|
| Sun Aug 15, 2010 6:02 pm |
|
|
megabreit
Joined: 03 Jan 2009
Posts: 141
|
|
| |
|
If you check for the game with the most solvers (and think it therefore might be the easiest to solve) then choose OneOfUs. At least I thought so, but OneOfUs is quite hard to solve for me, because the mathematical background is missing I think Mortal Coil and Modulo might also be interesting. After reading the forum, I guess, Crossflip is solvable too, but again with big portions of math. I don't have the lightest clue about Brickolage, Tapeworm or Pusherboy.
I'm currently working on OneOfUs, so it's (hopefully) the best choice
|
|
| Sun Aug 15, 2010 11:22 pm |
|
|
jonik555
Joined: 31 Aug 2009
Posts: 43
Location: Prague |
|
| |
|
Thanks. As I looked to OneOfUs I thing it won't be too difficult (I did seminary work(or how it's called in english) about similar theme at Math seminary this year...) See You in HighScore 
_________________
There are 10 types of people, those who understand ternary, those who think that this joke is about binary and the others. |
|
| Sun Aug 15, 2010 11:35 pm |
|
|
laz0r
Joined: 04 Feb 2010
Posts: 290
Location: Within the depths of Unix |
|
| |
|
Damn these NP-complete problems!
_________________
There is no spoon. |
|
| Mon Aug 16, 2010 8:46 am |
|
|
Meelo
Joined: 25 Apr 2009
Posts: 9
|
|
| |
|
 |
|
Damn these NP-complete problems! |
I don't think it's NP complete, actually. I'm fairly certain my implementation is running in quartic time. The times I'm getting seem to support it - it's at level 202 right now, and the average time to solve something has never drastically increased, as an efficiency worse than polynomial should.
On my fairly old computer, it takes about 0.03 seconds to solve one level (around level 200).
|
|
| Fri Sep 17, 2010 10:52 pm |
|
|
megabreit
Joined: 03 Jan 2009
Posts: 141
|
|
| |
|
@Meelo: I'm a bit confused... your profile says you're in level 3 in OneOfUs 
|
|
| Sat Sep 18, 2010 12:51 pm |
|
|
osterlaus
Joined: 02 Nov 2008
Posts: 20
|
|
| |
|
|
|
@Meelo: I'm a bit confused... your profile says you're in level 3 in OneOfUs |
This is the forum for the Runaway-bots 
|
|
| Sat Sep 18, 2010 2:38 pm |
 |
|
Hckr
Joined: 25 Mar 2010
Posts: 27
|
|
| |
|
Very nice puzzle, i enjoyed solving it. Next one will be Crossflip
|
|
| Tue Aug 30, 2011 4:40 pm |
|
|
causa prima
Joined: 19 Dec 2012
Posts: 1
|
|
| |
|
Finally!
My brute force approach worked until arround level 120, then I applied some preprocessng to the board, which improved the performance by about 20% for most boards. But over 60 minutes solving time was far to much, so I sat down with pencil and paper and worked out a solution. From then on the worst solving time was about 0.2 seconds, level 513 took 0.0045599937439 seconds. Why are there no bigger levels?
|
|
| Fri Jan 04, 2013 11:03 pm |
|
|
contagious
Joined: 12 May 2009
Posts: 35
Location: Greece |
|
| |
|
|
|
Finally!
Why are there no bigger levels? |
Because it took you 0.0045599937439 seconds to solve the last level.
|
|
| Wed Jan 16, 2013 2:11 pm |
|
|
m!nus
Joined: 28 Jul 2007
Posts: 202
Location: Germany |
|
| |
|
Finally finished this after dropping it a few years ago. Cheap ass Python implementation with just one optimization and just brute-forcing my way through, takes 2-3 minutes per level on the last ~15 levels. I know I should've probably looked for another optimization…
|
|
| Thu Jun 27, 2013 6:10 pm |
|
|
|
