Can there be a single game of Chess which includes all the possible situations that may arise during Chess? First of all, I am sorry as there were some completely inappropriate posts posted by my account earlier. This happened because I forgot to log my account out from the computer in Net Cafe I last enetered and a devil used my account. Anyways, come to the question.

I guess that first of all, I have to calculate in numbers that how many different situations may arise in chess using permutation/combination/Probability and then check that how many different situations arises in the biggest possible game of chess (not w.r.t time). If the number of situations in the biggest game is equal to the number calculated earlier, then I can say that answer is Yes otherwise No. However this all stays a guess. Permutations/combinations/Probability: I am an amateur w.r.t to these theories. So, I would be grateful if anybody helps by giving the answer to my title in yes or no and then explain why.
By considering the position of pawns it is easy to see that the answer to this question is no. Consider the following two positions:





Since once the A pawn has moved forward it will always be in a rank higher than 4, any game that has contained the first position cannot in the future contain the second and vice versa.
No, for the simple fact that the number of pieces on the board can only diminish or stay the same as the game goes on, and never go back up again (promotion still takes a piece of the board, namely a pawn), so once you reach a position where something has been captured, you have excluded the possibility of reaching a position where there are more pieces on the board; and since pawns can't move backwards, it is impossible to reach all positions prior to the capture.