I got stuck at level 22 for a month please help
I got stuck at level 22 for a month please help
here is the screenshot
please click on link below
https://fbcdn-sphotos-f-a.akamaihd.net/ ... d654598d99
please click on link below
https://fbcdn-sphotos-f-a.akamaihd.net/ ... d654598d99
-
- Posts: 58
- Joined: Thu Nov 29, 2012 7:45 pm
- Location: Germany
-
- Posts: 58
- Joined: Thu Nov 29, 2012 7:45 pm
- Location: Germany
Already the first move :)
http://www.directupload.net/file/d/3937 ... or_png.htm
If you want to go further, you will need some coding skills - not only for this puzzles, for all except tapeworm.
http://www.directupload.net/file/d/3937 ... or_png.htm
If you want to go further, you will need some coding skills - not only for this puzzles, for all except tapeworm.
- dangermouse
- Posts: 89
- Joined: Sun Jun 05, 2011 8:14 pm
- Location: deep space computing AG
- Contact:
hi eulerscheZahl,
why except Tapeworm? this problem should be NP-complete as it takes a polynomial time to verify its solution, not? can you articolate on this?
i tried to create a solver for tapeworm but in fact i got stuck very early...
thank you
ciao dm
why except Tapeworm? this problem should be NP-complete as it takes a polynomial time to verify its solution, not? can you articolate on this?
i tried to create a solver for tapeworm but in fact i got stuck very early...
thank you
ciao dm
Learn the rules if you want to break them effectively. Dalai Lama XV
-
- Posts: 58
- Joined: Thu Nov 29, 2012 7:45 pm
- Location: Germany
Because I listened to some audiobooks and played this puzzle by hand during that.
I have to consist, that I didn't write a single line of code for tapeworm.
edit: some observations about tapeworm:
* there is only one level with more than 3 different colors
* some levels are already solved before you make a single move (e.g. 638)
* for some levels there exist 2 different versions (e.g. 801)
* most of the levels are quite easy for a human (165 and 193 are both in the top 5 in my opinion)
* there are at least 3 free fields, at most as many as the number of rows.
here is the last level: http://www.directupload.net/file/d/3940 ... rx_png.htm
I have to consist, that I didn't write a single line of code for tapeworm.
edit: some observations about tapeworm:
* there is only one level with more than 3 different colors
* some levels are already solved before you make a single move (e.g. 638)
* for some levels there exist 2 different versions (e.g. 801)
* most of the levels are quite easy for a human (165 and 193 are both in the top 5 in my opinion)
* there are at least 3 free fields, at most as many as the number of rows.
here is the last level: http://www.directupload.net/file/d/3940 ... rx_png.htm
- dangermouse
- Posts: 89
- Joined: Sun Jun 05, 2011 8:14 pm
- Location: deep space computing AG
- Contact:
-
- Forum Admin
- Posts: 496
- Joined: Sat May 28, 2011 9:14 am
- Location: Germany
-
- Forum Admin
- Posts: 496
- Joined: Sat May 28, 2011 9:14 am
- Location: Germany
Are you quite sure?eulerscheZahl wrote: * there are at least 3 free fields
-
- Posts: 58
- Joined: Thu Nov 29, 2012 7:45 pm
- Location: Germany
I disagree ... your argument proves it belongs to NP. You have not mentioned the hard part ...dangermouse wrote:hi eulerscheZahl,
why except Tapeworm? this problem should be NP-complete as it takes a polynomial time to verify its solution, not? can you articolate on this?
i tried to create a solver for tapeworm but in fact i got stuck very early...
thank you
ciao dm
... and I agree with eulerscheZahl ... even with a lot of codding work the machine was slower than me in solving majority of levels (above say 800).
But isn't this thread about mortalcoil?