Username: 
Password: 
Restrict session to IP 

whaaa  Go to the Towers of Hanoi challenge

1 2
Global Rank: 744
Totalscore: 31507
Posts: 3
Thanks: 3
UpVotes: 3
Registered: 12y 39d

Last Seen: 12y 20d
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Just solved the hanoi towers challenge, I got the Congratulation message, got linked to solution=some hash site, and nothing happened! Woot Is this part of the challenge? I saved the hash so if I can PM anyone about this it would be great Smile
Global Rank: 235
Totalscore: 84975
Posts: 1369
Thanks: 1214
UpVotes: 734
Registered: 12y 173d




Last Seen: 6h 54m
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Maybe you just were not logged in.

Also it might be that you have to request the solutionpage with your browser manually.
Because the applet might not send the phpsessid to the pages.

Greetings
Gizmore
The geeks shall inherit the properties and methods of object earth.
Global Rank: 22979
Totalscore: 0
Posts: 251
Thanks: 229
UpVotes: 161
Registered: 20y 256d
Last Seen: 0s
The User is Online
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Is it possible to pass this challenge by doing it the "logic" way, rather than the "java" way?

I spent about 3 hours and got very close... ;)
Global Rank: 159
Totalscore: 114675
Posts: 166
Thanks: 158
UpVotes: 114
Registered: 12y 165d
Z`s Avatar



Last Seen: 42d 23h
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
In theory, yes, it is possible. The problem is that in some bad cases (network problems) it is not guaranteed, that solving the towers by hand will give you the good solution string.
I think in the Java way it could be solved in 30 minutes - if you are slow Smile
Global Rank: 9570
Totalscore: 290
Posts: 2
Thanks: 1
UpVotes: 1
Registered: 11y 288d
Last Seen: 10y 185d
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Quote from ObsidianAge

Is it possible to pass this challenge by doing it the "logic" way, rather than the "java" way?

I spent about 3 hours and got very close... ;)


Actually, no, it isn't (okay, it can be, but it's almost impossible). I've reversed the Java code and it seems it accepts ONLY one solution. Moreover, it has to be solved within 1024 moves.

Spoiler:
The simple recursive solution takes exactly 1023 moves, but it has several combinations (where to put the first token, which is the first state, etc.). I've played a lot of with this challange, but wasn't able to reproduce the required combination yet (or I've just failed to implement the hashing algorithm).

I'd really appreciate if I could talk in PM about this challange with someone.
Global Rank: 159
Totalscore: 114675
Posts: 166
Thanks: 158
UpVotes: 114
Registered: 12y 165d
Z`s Avatar



Last Seen: 42d 23h
The User is Offline
whaaa
Google/translate1Thank You!0Good Post!1Bad Post! link
You can always PM me, but I have to say that:

Yes, there is only one accepted solution.

This solution is unique, because the solution which completes the challenge in 1023 moves is unique. If you put your first disc to the right peg (and not to the middle peg), you can't solve it in 1023 moves.

The final state is reached if all discs are on the right peg, please be aware of it.
Global Rank: 45
Totalscore: 254057
Posts: 117
Thanks: 106
UpVotes: 103
Registered: 12y 156d
livinskull`s Avatar





Last Seen: 2d 16h
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Weird..
Thought I solved it with a little program i wrote Happy
So it IS possible Drool
Seemed to have some luck nevertheless...
Global Rank: 346
Totalscore: 62452
Posts: 3
Thanks: 5
UpVotes: 2
Registered: 11y 86d


Last Seen: 5y 203d
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
errr.. just solved it in a logic way, took me about 30 min. it showed me "congratulations" and redirected to the page saying the solution is wrong.. why? i was still logged in.
Global Rank: 235
Totalscore: 84975
Posts: 1369
Thanks: 1214
UpVotes: 734
Registered: 12y 173d




Last Seen: 6h 54m
The User is Offline
whaaa
Google/translate1Thank You!0Good Post!1Bad Post! link
Z changed his Towers of hanoi challenge, it now has an official time limit of 60 seconds to solve the problem.

Edit: You can see the new applet and description here: /challenge/hanoi, and there is also a link to the challenge in the thread title (every challenge related thread should have that)
The geeks shall inherit the properties and methods of object earth.
Last edited by Gizmore - May 21, 2009 - 23:02:27
Global Rank: 611
Totalscore: 37913
Posts: 25
Thanks: 13
UpVotes: 13
Registered: 10y 364d
Vampire`s Avatar
Last Seen: 1y 173d
The User is Offline
whaaa
Google/translate1Thank You!1Good Post!0Bad Post! link
Actually it IS still possible to solve this one the "logical" way. You just have to do some patching first, because doing 1023 moves in 60 seconds is really challenging. Smile

BUT, don't do it. I know how to solve the Towers of Hanoi since I'm a child, but still doing 1023 moves needs time, and precision. You must not do any false move, because you cannot correct it within the 1023 moves limit, so you need the shortest possible solution. And also you have to be lucky that the browser doesn't crash and as Z already wrote, that your network connection is stable as the applet is not as stable as it could be. Actually it took me some tries, because I tried to do it too fast and made errors, or the browser crashed, or whatever, and of course not before at least 500 moves were made already.

Doing it the "non-logical" way did cost me about 5-10 minutes and is far more reliable. Smile
1 2
Redknee, tunelko, silenttrack, qdxy, n0tHappy, Vampire, TheHiveMind, Z, Ge0, samuraiblanco, arraez, jcquinterov, hophuocthinh, alfamen2, burhanudinn123, Ben_Dover, stephanduran89, braddie0 have subscribed to this thread and receive emails on new posts.
1 people are watching the thread at the moment.
This thread has been viewed 16263 times.