What is your problem, mate? You looking for an exceptional thread or what? This post is useless and you know it.
shortest game not by mate

No checkmate, no resignation and no draw agreement? Then it would be the shortest stalemate.
http://www.chess.com/article/view/the-shortest-stalemate-possible

Pfff... The shortest draw can be obtained by the threefold repetition rule:
1. Nf3. Nf6. 2. Ng1. Ng8. 3. Nf3. Nf6. 4. Ng1. Ng8.
After the last move of Black the starting position is seen for the third time on the board, which make the whole game a draw.
tennisbal's game is cute! :-)
Sincerely,
Dragon.Jade :-)

White's cell phone goes off just after he makes his first move and his game is forfeited after 1 move. Not a checkmate, resignation, or draw agreement. But surely not the answer you are looking for.

Pfff... The shortest draw can be obtained by the threefold repetition rule:
1. Nf3. Nf6. 2. Ng1. Ng8. 3. Nf3. Nf6. 4. Ng1. Ng8.
After the last move of Black the starting position is seen for the third time on the board, which make the whole game a draw.
tennisbal's game is cute! :-)
Sincerely,
Dragon.Jade :-)
That's pretty much a draw by mutual agreement. But yeah I guess it's the shortest possible game that's not a resignation, draw by mutual agreement or resignation.
There would be multiple answers if this solution is allowed.
Stupid problem really.
I think IPA-Ray's is the answer I was least expecting! I agree Tennisbat's stalemate is cute.
The answer I was thinking of was by threefold position repetition when the draw does not have to be agreed but can be claimed. So the answer is 4. One example of moving the knights backwards and forwards to achieve this was given by jazzdream.

Tennisbal's solution was actually composed by Sam Loyd.
two players in norway copied it in a tournament and both players got 0 points instead of ½ for the too obvious draw.

I know an other solution. It is from Sam Loyd. The solutions from Sam Loyd I found in the (German) book Schach und Mathematik, by J. Gik. (Schach und Mathematik means chess and mathematics)
This is similar to my last two questions, but hopefully this will be a lot more difficult.
Excluding by checkmate, what is the shortest game possible? This excludes games where players resign or agree a draw. For example if a player resigns on move 2 or both players agree a draw on move 2 this would not be included. The shortest game is the minimal number of moves.
Hint: It is less than 15 moves. If no one gives the answer by tomorrow (with the reason) I’ll give a clue tomorrow, and give the answer on Friday.