AUSTIM TEST

...

missed one

IQ 201 ama

fug I missed one

Leave the utilities for the houses to grab they're all indirectly supplied with resources they just can just plug it in themselves. not my job.

Didn't break any rules

What is supposed to be hard about this one? I'm genuinely asking here.

10/10

You don't have gas for all 3

...

...

Why doesn't the third guy get gas?

give me a n o t h e r

...

this is impossible what the fuck

The correct answer is that there are no doors in that picture, so it's not possible to solve the problem

...

It can't be done. The complete bipartite graph k 3,3 is non-planar.

You can prove this by contradiction using the formula v - e + f = 2. Where v is vertices, e is edges, and f is faces.

Good thing it doesn't say that you HAVE to use the doors

...

...

winrar

It never said not to fill in the doors. So good job

...

...

...

You THINK they cross, but it's just an illusion.

wow
that makes me think...

F

[math]K_{3,\,3}[/math] is not planar.

You can trivially model this as a hamiltonian or eulerian path searching problem and show it doesn't exist with brute force. Or you can use this:
>An undirected graph has an Eulerian trail if and only if exactly zero or two vertices have odd degree, and all of its vertices with nonzero degree belong to a single connected component.
and notice three rooms have an odd number of doorways.

F, like faggot.

This one is F. Just because it stumped your aunt of facebook doesn't mean it's hard

Closest I got. Is it even possible?

pretty obvious

...

He didn't pay taxes

Full winrar
∞ internets for U

Underated

...

a planar bipartite graph with 6 nodes has at most 8 edges, so you can't connect everything without crossing brainlets

Why not G?

discharge? Radii of the openings? There's no fucking way to know this

gg ez

D is blocked off

nerd

L

not a jew

this wins

>trebek: "as with all of our games, we will let tonight's returning winner start: you may go, user."
>user: "how about 'brainlet: baited' for 400?"
>trebek: "this question, recently posted in one of many problembait Veeky Forums threads, has a bunch of autistic brainlets trying to solve a rephrased version of a problem that has already been proven to have no solutions."
>*bzzt*
>trebek: "yes, user?"
>user: "what is the seven bridges of konigsberg problem?"
>trebek: "that is correct user, and you will be taking the lead for now, would you like to pick another category?"
>user: "sure alex, i'll pick shitty internet fourms with sci in the title for 600."
and so on and so on

All me

At least writing out the larp was fun

Bbaited again, thanks for another (you)

/b/ figured this out a long time ago.

Hint: You have to think with portals.

Either that does not go through any doors, or it goes through them an infinite number of times.

...

What level math is this? Sounds fucking cool

just pull the water over the first house.
but no. it's not possible.

trivial

1. Dissolve gas into water
2. Apply mains current to water
wiring companies will go broke

made my morning...thank you autismo-san!

Depends on how fast the water is flowing.

What level is that

Pretty sure its graph theory

lyl

just make it a single point of intersection

fuggggg :D

It's G, A falls on B falls on C falls on D and ends on G

It was quite easy and I'm not an autist.

Intro level graph theory, read it.

>I'm not an autist
user, I...

...

Fucking nice user

kek

Literally got it in my first week from my bachelor

>trying to be funny and still missing one

time for suicide

...

[spoiler]LOL[/spoiler]

Lmao

You are supposed to print this out then draw on the paper and fold the paper in order to complete it.

There's a blockage across the line for entering D so it can't enter D.

made me chuckle

underrated