More chess moves than atoms in universe?

Is it true that there are more possible chess moves than atoms in the universe?

What do you mean by possible chess moves? A game could conceivably go on forever with each player just moving their King (or knight, or queen, or whatever) around and around in a circle without doing anything. What are the restrictions on this?

How about making it possible DIFFERENT moves? Thus, figure out how many possible positions there are of pieces on the chess boards, and then how many uniquely different moves can be made from each?

It’s going to be a pretty high number.

Whatever the souce is that the OP is referring to, I’m sure this must be what was meant. Further, I think there would have to be a restriction to legal positions. For instance, both bishops on a side can collectively hit all the squares, but each individual bishop is restricted to either black or white squares.

Don’t forget to take into account pawn promotion. You could conceivably have 5 black bishops and 5 white bishops.

Or even nine white bishops, allowing for the fact that pawns move sideways one column wherever they capture, and this would affect the color of their promotion square.

howstuffworks.com has an article on chess computing. This is the pertinent part:

Indeed. Hadn’t thought of that possibility.

IIRC, after 30 moves this is an automatic stalemate.

The number of physical things is a relatively low number compared to almost any computation of permutations. The number of possible variations of a deck of cards is 52! or 80658175170943878571660636856403766975289505440883277824000000000000 or 10[sup]68[/sup]. It would take only a slightly larger deck to outnumber all particles in the universe. Two decks would be vastly huger even than 10[sup]100[/sup] or googol.

As an aside, I wonder how complicated it would be to construct some kind of computer program that would take as input a chess board, and determine whether or not there was some legal sequence of moves from a regulation start that could lead to that point.

It would obviously get impractical to solve the question from a brute force angle, (as lno’s cite covers,) and could be very convoluted to solve the question deductively. Some of the simpler aspects that immediately occur to me…

  • if white has two pawns on the same column, but black still has all of his pieces and pawns, that’s a pretty obvious disqualifier.
  • either player could conceivably transpose his knight and rook on the same side without disturbing any of the pieces surrounding them, but not a knight and a bishop.
    I remember reading a chess puzzler in scientific american which hinged on the following succession of deductions.
  • The position was declared to be one reachable during the course of legal play. Black apparently had all of his pieces and pawns in their starting places, and white apparently had all of his pieces in starting places, but had no more pawns left.
  • However, black’s king and queen were switched, (noticeable because one of them must always start on a black square.)
  • the king and queen cannot transpose in their true starting places without disturbing at least one of the pawns in front of them or to the sides, which can then not return to their starting positions. Therefore…

[spoiler]- No pieces were actually at their starting places - the board is upside down from the way it appears. Black’s pieces are all pinned against black’s eighth file by his pawns. Black can only resolve this situation by hopping his knights over the pawns, moving pawns in to promote them, which creates an opening in the row of pawns on seventh file.

  • As it happens, black does not have time. White has a mate in four by using one of his own knights to checkmate the (thoroughly trapped) black king across the layer of pawns. If black does not play defensively against this option, white can actually make the mate in three, but black cannot stop it entirely.[/spoiler]

Quite a trick question, if you ask me.

On preview…

An automatic draw, I believe. ‘Stalemate’ in chess is a particular draw condition where one player is not in check but cannot make a legal move. There is also draw by perpetual check, and the 30-move rule, whose name I do not remember offhand.
Incidentally, I’ve always wondered what chess would be like if the following rule changes were adopted to alter the stalemate rule.

  • if player A stalemates B, (A moves such that B has no legal move,) B is considered to be constrained to ‘offer a draw’ to A, but A is not obliged to accept. He can instead play on, with B being unable to move until such time as the stalemate is lifted. In other words, if A wants to play on, he may immediately make any other legal move that he can, without a response from B other than the verbal response ‘stalemate’.
  • if A’s move keeps B under stalemate, he can continue to move or change his mind and accept the draw. If it lifts the stalemate and allows B one or more legal moves, B must now make one of them.
  • in the case of a double stalemate… (A has no further legal moves himself, which is possible although I cannot remember an example,) then the draw is final with no exceptions.

IIRC, three occurences of the same position make the game a draw. They might have to all occur within 40 moves, but I’m not very confident of that.

I believe in most cases, that would result in the first player mating in a few moves. Consider: If you stalemate but have a pawn left, you’d likely be able to promote that pawn and mate with it. There are exceptions of course.

If you have other pieces left, you’re free to use them to capture the stalemated player’s pieces and also to take as long as you need to maneuver them to give mate.

I’m pretty sure it would usually result in mate for the stalemating player.

Yeah, you might be right. I think there could ALSO be a rule along the lines of ‘if both players keep moving for 200 moves, neither of them advancing a pawn, nobody checking anyone, nobody capturing anyone, then the game is considered to be a draw.’

Yeah, that makes sense. There would be some stalemating situations where the player who gets the stalemate advantage would not quite be able to drive a fatal attack home, but that would probably be rare.

I know that there are some circumstances (king-pawn versus king for example) where the player at a disadvantage would be strongly inclined to lure his opponent into stalemating him, if that is at all possible, since a draw is the best outcome he can hope for. (if you have a king-pawn versus king, with all three pieces on the same column, the lone king on the pawn’s queening file, then the pawn one file away, and the king on the other side, with the lone king to move, that’s a stalemate correct?? The lone king cannot move to either side because he would be in check from the pawn, cannot capture the pawn or move to either side of it because of the enemy king, and yet he is not being attacked where he sits.)

I love a chance for some obscure chess talk. :wink:

Nitpick:

Actually, the “50 moves rule” (not 30 or 40 or 200) does not say that the game automatically ends in a draw after 50 moves with nothing interesting happening – it only says that either player can claim a draw in that situation. If neither player chooses to claim a draw, then the game can theoretically go on for an infinite number of moves (assuming that no chess clock is used).

Official FIDE chess rules

As an interesting aside it should be noted that as amazing as the possibilities are in Chess the possibilites in the Chinese game Go dwarf it. It is psrtly for this reason that no one has been able to make a computer program even remotely good at playing Go (supposedly the very best out today can’t even beat a mediocre player).

I’m pretty sure there are only 13,383,816 possible chess moves.

Also note that USCF rules might be different on that point (but probably aren’t). Additionally, it’s 50 reversible moves. Capturing a piece, advancing a pawn, etc. starts the count over. Also, some endgames are proven to require more than 50 moves to force a mate (I think K vs. K+N+B is one but don’t hold me to that), and have limits higher than 50–though I’ve never seen that matter in practice.

The answer to the original question is that it’s not the number of moves, but legal games (i.e. the movelist from start to finish) that outnumber atoms in the universe.

Of course I know I should have looked up the rules, but where’s the fun in that? Thanks!

No no, You can promote Pawns to Queens right?
Maybe we mean “fairy chess pieces” :eek: Squirels, KnightRiders, Windmills, Jokers, Wafils, Edgehogs…

I thought there was a whole series of Chess problems where the entire concept of the puzzle was to your self reconstruct how the game started.