Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[Donald X.]

I've always appreciated hatch #40, "Which is more." You have to click left a bunch of times but you will see some stuff on the way. http://www.eyezmaze.com/eyezblog_en/blog/2005/01/hatch_today.html

[Kirian]

31 on my first try, but I would have failed on certain colors--I'm not technically color blind but I have a rare color sense deficiency.

[LastFootnote]

I've always appreciated hatch #40, "Which is more." You have to click left a bunch of times but you will see some stuff on the way. http://www.eyezmaze.com/eyezblog_en/blog/2005/01/hatch_today.html

Once I figured out what I was doing, I got about 34. Tough game.

[pacovf]

Reminds me of this color discrimination test/game (not sure if posted here before):

http://www.xrite.com/online-color-test-challenge

Man, that was horribly difficult (just spent 15 minutes trying to get it right), and that is coming from someone who has no colour blindness. It must be hell for someone with one.

It is clear Walrus hates colour blind people.

[markusin]

http://game.ioxapp.com/color/

Find the square that's a different colour.  You have one minute to get as many as you can.  The best I've done is 27.

Yeah a friend just showed me this yesterday. May record is now 42. I don't have colour blindness.

The green annoys me the most, I think. It's the only colour I messed up in the eye test.

[AHoppy]

http://game.ioxapp.com/color/

Find the square that's a different colour.  You have one minute to get as many as you can.  The best I've done is 27.

1st try: 38. The most confusing part was how the last square you hit blinked. It confused me...

[eHalcyon]

https://vine.co/v/hdKWjxhDhze

This is wonderful.

[GeoLib]

https://vine.co/v/hdKWjxhDhze

This is wonderful.

I don't get it... He's poking a bird?

[eHalcyon]

https://vine.co/v/hdKWjxhDhze

This is wonderful.

I don't get it... He's poking a bird?

Unmute button is in the top left of the video.  It's hard to see.

[GeoLib]

https://vine.co/v/hdKWjxhDhze

This is wonderful.

I don't get it... He's poking a bird?

Unmute button is in the top left of the video.  It's hard to see.

Aaaah. That is very hard to see. Makes a lot more sense now.

[Titandrake]

Dustforce, it's so good and I love it and I hate it and if you are at all a fan of platformers you should go buy the current Humble Bundle because it has it right now. Back to grinding out Clocktower...

[Hydrad]

Dustforce, it's so good and I love it and I hate it and if you are at all a fan of platformers you should go buy the current Humble Bundle because it has it right now. Back to grinding out Clocktower...

I love platformers but this game is just such and extra difficulty jump then I'm use to. It doesn't help that I play a level until i get a SS so it takes me a while to play through all of them.

I would still reccomend this game though. I love it.

[Titandrake]

Dustforce, it's so good and I love it and I hate it and if you are at all a fan of platformers you should go buy the current Humble Bundle because it has it right now. Back to grinding out Clocktower...

I love platformers but this game is just such and extra difficulty jump then I'm use to. It doesn't help that I play a level until i get a SS so it takes me a while to play through all of them.

I would still reccomend this game though. I love it.

The team behind it released an update a few days ago that tries to fix this - they added 2 extra tutorials + 16 easier levels. The easier levels give you bronze keys that unlock the levels that were normally unlocked by default.

Personally, I feel like the new tutorials aren't as good and go a bit slow, but the advanced tutorial is the exception and is very nice.

For difficulty, the wall between silver key levels and gold key levels is really ridiculous, but up til there it's well done. Generally forest/mansion levels are easier than city/lab levels for people who do try it out.

[Witherweaver]

A* search algorithm, apparently:

[GeoLib]

A* search algorithm, apparently:

That just looks like Breadth-First Search to me. If it's doing A*, I think it must be doing it pretty terribly, since the heuristic distance could easily be Δx+ Δy, which is the minimum distance between any two nodes on a grid. In that case, it really shouldn't explore that far out to the side. What are other people's thoughts?

[Kirian]

A* search algorithm, apparently:

I don't get it.

[GeoLib]

A* search algorithm, apparently:

I don't get it.

It's the name of the search algorithm, and that's a visualization of someone's implementation. (wiki)

[Witherweaver]

A* search algorithm, apparently:

...

That just looks like Breadth-First Search to me. If it's doing A*, I think it must be doing it pretty terribly, since the heuristic distance could easily be Δx+ Δy, which is the minimum distance between any two nodes on a grid. In that case, it really shouldn't explore that far out to the side. What are other people's thoughts?

Hmm.. I'm not sure what you mean.. if you just start going in the y-direction, you have no guarantee there won't be a barrier that makes you backtrack all the way to the beginning. 

[Witherweaver]

For clarity (from the source):

A* is a pathfinding algorithm. Its purpose is to find the best path between two points.

Green = path (the first 2 are the start/goal).
Cyan = in queue to be evaluated
Blue = evaluated
Black = obstacle

If you're curious
http://en.wikipedia.org/wiki/A*_search_algorithm

[Witherweaver]

Or maybe it really isn't A*.  I don't actually know.

[GeoLib]

A* search algorithm, apparently:

...

That just looks like Breadth-First Search to me. If it's doing A*, I think it must be doing it pretty terribly, since the heuristic distance could easily be Δx+ Δy, which is the minimum distance between any two nodes on a grid. In that case, it really shouldn't explore that far out to the side. What are other people's thoughts?

Hmm.. I'm not sure what you mean.. if you just start going in the y-direction, you have no guarantee there won't be a barrier that makes you backtrack all the way to the beginning.

If you look at the wiki, the way A* works is that it explores "more promising" nodes first, those where (the distance from the start) + (a heuristic lower bound on the distance to the goal) is smallest. I think with a good heuristic (like the minimum distance on an obstacle-free grid between the current node and the goal) it wouldn't explore that far out to the side before finding the goal. This is just my intuition, but I may very well be wrong.

[Witherweaver]

Yeah I started reading after that.  I think you're right, based on that and the comments.  This gif may be using no weight (so Dijkstra).

[GeoLib]

Yeah I started reading after that.  I think you're right, based on that and the comments.  This gif may be using no weight (so Dijkstra).

Yeah, and since every edge is presumably weighted the same, Dijkstra's is in turn just BFS.

[Witherweaver]

Yeah I started reading after that.  I think you're right, based on that and the comments.  This gif may be using no weight (so Dijkstra).

Yeah, and since every edge is presumably weighted the same, Dijkstra's is in turn just BFS.

Would be neat if they showed the gif for different weighting functions.

[GeoLib]

Yeah I started reading after that.  I think you're right, based on that and the comments.  This gif may be using no weight (so Dijkstra).

Yeah, and since every edge is presumably weighted the same, Dijkstra's is in turn just BFS.

Would be neat if they showed the gif for different weighting functions.

I'm kind of tempted to implement it now. Next time I have free time, I might do so.