Forums

Extraordinarily complex

Sort:
grass-hopper

Chess is extraordinarily complex.

(Wolfram Alpha, the encyclopedia of all things math, has a whole page about it).

The current estimate for the number of possible games of chess is 10^120 (also known as the Shannon number, after Claude Shannon who worked it out).

That’s 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000, 000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000, 000,000,000,000,000,000,000 different games.

The math there goes like this. Let’s say white goes first. When the game starts there are 20 possible moves for the white side. In response, the black side can make 20 moves. So in the first two moves, there are 400 possible configurations. For the second move, there are now 20,000 possible positions, and so on and so forth.

cladclan

Wow man,talk about complex!

trysts

Is that based on the average number of moves in the game being 40 moves? Or is that all possible games?

Scottrf
Salim80 wrote:

you can just move pieces back and forth unlimited times

I presume it's based on the 50 move rule.

Arraskrahe

It is the number of positions ... Moving a piece back and forth (and your opponent does the same) will not result in more than 2 different positions; 4 if half-moves are concidered.

Scottrf
Arraskrahe wrote:

It is the number of positions ... Moving a piece back and forth (and your opponent does the same) will not result in more than 2 different positions; 4 if half-moves are concidered.

But this is the number of possible games, not positions.

Arraskrahe

Oh sorry yes, the topic was about different games. In that case, if I recall, they took the avarage lenght of games and the avarage number of legal moves (branching factor).

ElKitch

Now calculate this for Risk...

piero333

Men.....my memory is not that big......that's why I can't progress any further...!!!!!! still have a lot of postions to learn.....!!!!!!

Sudarshan-Bhat

lol thats cool.

NimzoRoy

FUN FACT: (Computer scientitist Victor) "Allis estimated the game-tree complexity to be at least 10123, "based on an average branching factor of 35 and an average game length of 80". As a comparison, the number of atoms in the observable universe, to which it is often compared, is estimated to be between 4×1079 and 1081." (1st source)

MORE FUN FACTS FYI:

https://en.wikipedia.org/wiki/Victor_Allis

https://en.wikipedia.org/wiki/Game_complexity

http://finaltheoryofchess.game-server.cc:78/mediawiki/index.php/The_Problem_of_Complexity

https://en.wikipedia.org/wiki/Shannon_number