hacker.org

here is the screenshot

please click on link below



https://fbcdn-sphotos-f-a.akamaihd.net/ ... d654598d99

You won't get far, if you can't solve this. My bruteforce solver failed at level 54 while this one can be solved nearly instantly.
Starting position is at 8/8, end at 2/6 (0/0 is at the top left corner).

thank you sir .

what did i do wrong

https://fbcdn-sphotos-d-a.akamaihd.net/ ... 20c0670203

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.

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

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

thank you 2.71828182845904523536028747135266249775724709369995(...) for the powerful e^xplanation! human against machine 1:0 then

eulerscheZahl wrote: edit: some observations about tapeworm:
* there is only one level with more than 3 different colors

Huh, that's gotta be level 8 then. This is where I am right now. Four colo(u)rs

eulerscheZahl wrote: * there are at least 3 free fields

Are you quite sure?

I ment the later levels - the first ones were generated by a human. There are some levels with more free fields among the first levels as well. But I can't remember this level, I must have forgotten it. :oops:

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

I disagree ... your argument proves it belongs to NP. You have not mentioned the hard part ...
... 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?

Hi... I solved this manually up to 39 LvL.

Just for fun.

https://rentdrikkevann.net