what are the number of moves in a single chess game?

Answer 1

I'm afraid your question doesn't make sense pal. Edit your question and be more specific about what you mean.

Answer 2

There are two ways to interpret your question, so I'll supply two answers.

First, if you are asking something along the lines of what's the maximum number of moves a single chess game could possibly have before ending in mate or draw, I'm not sure.

However, the longest recorded game in history happened in Belgrade in 1989, and lasted for 269 complete moves, before ending in a draw.

Click on my first source link to "replay" that entire game using a Java-created chess board.



The second possible question could be what is number of different chess games that could possibly be played?

That answer was estimated by Claude Shannon, the father of information theory. He concluded that the number of different possible chess games that could be played (measuring by their different game trees), is on the order of 10 ^ 120.

By comparison, the number of seconds in the Universe, assuming it is about 15 billion years old, is only on the order of 4 x 10 ^ 17.

Therefore, even if you could devise a computer or a way to actually play billions or trillions of games of chess per second, you still wouldn't be able to play each and every possible different game tree. This is because it would still require more time than which the Universe has been in existence.

More about Mr. Shannon can be found in the Wikipedia entry that I supply as my second source.

Answer 3

a game of chess (between club players) has usually about 40 moves. it can also have 70-80 moves if there's an exciting final position.