isomorbism:

piedude:

tahthetrickster:

jo3mm:

kipplekipple:

catgirlvoid:

catgirl-bimbo:

catgirldick:

sharkiethedork:

chongoblog:

2pacula:

c0rpseductor:

chongoblog:

hexea:

chongoblog:

Haters be like

“It’s totally possible to make a path that goes through every door exactly once”

Idk if I did it right

sorry!

it’s true you can’t draw one continuous line that would do the trick. but if the kitty and bunny set out by going through the doors they’re marked beside and each walked the certain way their colored arrows show at the same time their “collective path” as a team would go through each door only once. The moral of the story is actually about friendship , and cooperation, because in this world there are tasks you can’t do on your own.

im just fucking with you i’m pretty sure this has no right answer

i concocted a solution with a 100% mortality rate

Stop being so incredibly funny on my impossible puzzle post

You can switch the tracks so the trolley will kill one person, or you can allow it to attempt the fruitless crusade of running over each person in the maze only once.

all in a days work! *passes out*

My indecisive butt, walking in and being faced with having to make a decision, immediately leaving

oOoOoooo I’m a ghost!

Fire

dude my house

What I love about tumblr is when we see a logic problem meant to be frustrating and/or unsolvable, we almost reflexively try to destroy it.

This website’s userbase is a chimp chewing through a Chinese finger trap

This is a graph theory problem.

If anyone wants to see why it’s actually impossible: if we go through a room without starting or ending in it, we must go through an even number of doors in it (since each time we go in and out of a previously unvisited door). So we can go through an odd number of doors in a max of two rooms. However, there are three rooms with five doors.