Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
How good are you at mazes?
#21
Devil's Sunrise Wrote:Wow, impressive grinding skills. I'm gonna start now checking what I can do to get the way out of that maze the fastest way possible. Looking at theories, mainly.


If only those grinding skills would transfer over to me training my DK...

I'm going to give it one last shot before I find something else to do.

Edit~ Dang, wasn't able to finish it in time and I have to start over, don't ask.
Reply
#22
You guys are nubs. I'll tell you the pro way to solve this maze.

Copy image. Paste into image editting program. Select the 'fill' tool. Choose a different color. Fill in the white.

After you fill everything in, you see that this maze is bogus. You can start anywhere and get anywhere. You can go anywhere in the maze from any starting point. Thanks for wasting a minute of my life.
Reply
#23
:f6: If you fill something in, however, in a maze...doesn't it fill in the whole thing? I mean, the fill in doesn't just follow a certain path, lol. The fill in travels through all routes.
Reply
#24
The question was how good I was at the maze. The answer is that I'm so awesome I can try every single possibility in 5 seconds. I'm godly.
Reply
#25
Someone with Photoshop look up "how to solve a maze with photoshop" it's hilariously usefulGlitter
Reply
#26
-Face Palm-

That's what I did wrong. I forgot to mess with the contrast and pixel editting.

I failed.
Reply
#27
Okay. I printed it out. Doesn't fit on one page; I resized to 49% and printed on two pages instead of anywhere between four and nine pages. The resolution is still so tiny a line with my ballpoint pen completely fills a pathway...

...Magus, may I demand you complete this yourself to prove it possible?
Reply
#28
THere's no start or end in this maze...
Reply
#29
You may find this post helpful (:
Reply
#30
jrvillarreal Wrote:Someone with Photoshop look up "how to solve a maze with photoshop" it's hilariously usefulGlitter

That's cheating, kinda. Try to use an algorithm in programming to do it.
Reply
#31
Screw that. I think my eyes are now bleeding. Tongue
Reply
#32
xkatiie Wrote:Screw that. I think my eyes are now bleeding. Tongue

You are not the only one. That thing looks never ending. D:
Reply
#33
Wouldn't it just be easier to put this in paint or photoshop, draw a line through most of the walls so you can reach the end easily, and then just claim the gremlins did it.
Reply
#34
I feel like I just spooned my eyes out looking at it @_@
Reply
#35
Rain Wrote:I feel like I just spooned my eyes out looking at it @_@

pineapple a spoon. I used a Spork! Maybe if I'm super bored later I might print it up and try it.
Reply
#36
Bacon Wrote:You guys are nubs. I'll tell you the pro way to solve this maze.

Copy image. Paste into image editting program. Select the 'fill' tool. Choose a different color. Fill in the white.

After you fill everything in, you see that this maze is bogus. You can start anywhere and get anywhere. You can go anywhere in the maze from any starting point. Thanks for wasting a minute of my life.

I'd rather use the fill tool like this:
 OMG spoilers

Pseudocode for a contiguous fill is not too complex, especially with a 2-color GIF like this where all color matches are exact. Recursively ...
Code:
fill(x,y,newcolor) {
  oldcolor=color(x,y);
  color(x,y) = newcolor;
  for (int i = 0; i<4;i++) {
      if ( color(x+cos(pi/2*i),y+sin(pi/2*i)) == oldcolor ) {
        fill(x+cos(pi/2*i),y+sin(pi/2*i),newcolor);
      }
    }
  }
}
edit: oops
Reply
#37
Great, but it would be nice if I could see the entrance. -.-
Reply
#38
Stereo Wrote:Pseudocode for a contiguous fill is not too complex, especially with a 2-color GIF like this where all color matches are exact. Recursively ...
Code:
fill(x,y,newcolor) {
  oldcolor=color(x,y);
  color(x,y) = newcolor;
  for (int i = 0; i<4;i++) {
      if ( color(x+cos(pi/2*i),y+sin(pi/2*i)) == oldcolor ) {
        fill(x+cos(pi/2*i),y+sin(pi/2*i),newcolor);
      }
    }
  }
}
edit: oops[/color]

I rather meant an A* Algorithm.
 Spoiler

Finding the shortest way to the end. (As is in this case the only way).
Reply
#39
You.
Suck.

It'd probably be easier to write a program that scans the maze for the path. :[

Edit~
@previous post:
Speak of the devil. XD
Reply
#40
Dang, I felt like I had a seizure looking at that thing. >_>
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)