Even if a woodchuck could chuck wood and even if a woodchuck would chuck wood, should a woodchuck chuck wood?

But you should have said before:

But if a woodchuck could chuck and would chuck some amount of wood, what amount of wood would a woodchuck chuck?

Ok, I hope this one sticks:

A ninja is trying to get in a building that only has one floor. The building has a total of 16 rooms, which are all square shaped and all of the same size (seen from above, the biulding has the shape of a square). All of the rooms have guards in them and are all conected to each other through soundproof doors. There are only two ways into the building: the most northwest room and the most southeast room. The guard in the most northwest goes out for a smoke and the ninja swoops in and kills him. When he enters the room where the guard was the door locks behind him, so he can`t get out of the building. His mission is to kill every single guard without ever going back to the murder scenes and still escape the building. How will he do that?

PS.: Sorry for bad english :)

He's a ninja. He goes through the ceiling. :)

I don't suppose that he could pass through a room without killing a guard, could he (ninja stealth)?  That way he could return to a room without returning to a murder scene!

Okay guys, in the original question it was a prisoner, not a ninja. But i like ninjas so...
Because he goes through the doors, the guard hears the ninja entering and he has to kill the guard that's in that room. But because he is a ninja, he can kill him before he calls for help and without making any noises. He can't go underground or through the ceiling because I already said that the only way into any of the rooms is through one of the doors!

At first, I thought your puzzle was really easy reading it but then I drew the rooms and realized it wasn't as easy as I thought. There's always one room I can't go to without returning on a murder scene.

Ok. I can figure out how to get out through every room, but the most southeast one.

One thing though - can he return to the original square? (Because then it's piece of cake).

...
Ofc he can
That's BRILLIANT Oyvoy.
Remember the wording.
"The guard in the most northwest goes out for a smoke and the ninja swoops in and kills him. "

and then

"His mission is to kill every single guard without ever going back to the murder scenes and still escape the building."

@ Oyvoyvoyv and Killergran:
That's it! The first room isn't a murder scene 'cuase the guard was killed outside of the building!
Ok, the ones I'm bringing in are way too easy for you guys!
This next one is almost like a sudoku, but with a little catch: 26 35 37 31 36 39 38 26 24

There are eight blank spaces surrounding the numbers in red. The sum of these numbers will equal the number in red. The blank spaces can only be filled with numbers from 1 to 7. Once completed correctly, no row nor column will contain a duplicate number within a blank space.

PS.: This is waaaaay harder than an usual sudoku!

EDIT: I put lines to define the empty squares, does this help?

I don't really get your latest puzzle.

As this thread is dieing (or already dead), I'll do an easy one to start it again (can't kill off this thread, it's awesome)

A man wears black pants, black shoes, black shirt, black hat, black gloves, and black socks. There are no streetlights on. Against him comes a black car, that has no lights on. It manages to stop in time, without hitting the man. How did the man in the car see the man walking?