Skip to main content

Questions tagged [game-complexity]

For questions regarding the game complexity of chess, in particular the number of possible chess games and the number of possible chess positions.

2 votes
0 answers
77 views

I've written a script implementing a basic idea to count the number of chess positions. I've not even accounted for legality of the positions or difference in light and dark square bishops. Despite ...
Yash Jain's user avatar
  • 545
1 vote
1 answer
158 views

I have heard of Shannon's number (10^120) which is the supposed number of possible chess games computed in the 1950s. But Shannon's estimate is criticised for including illegal moves. What is a truer ...
anti - Marshall's user avatar
20 votes
6 answers
7k views

The other day, a Tuesday probably, I was watching a blitz game between 2 titled players, Daniel Naroditsky and David Paravyan. They only have about 1 minute remaining, and from this moment ... they ...
Déjà vu's user avatar
  • 627
0 votes
2 answers
387 views

This is Vietnamese Mathematical Chess— http://cotoan.vnvista.com/rules-en.html The board contains 11 ranks and 9 files. Each side has ten pieces, numbered from 0 to 9. The board initial layout is as ...
user avatar
4 votes
4 answers
2k views

An interesting new variant of chess has emerged, showing that chess will always be fresh-5D chess. I mostly play the 5x5 version, but the positions do not rocket out of control like in the standard ...
A.Shetye's user avatar
  • 746
29 votes
14 answers
9k views

It is estimated that the total number of legal positions in chess is somewhere between 10^40 and 10^50. This is of course an enormous number. Computers today with reasonably good chess software can ...
Klangen's user avatar
  • 979
2 votes
3 answers
279 views

What would a playable chess variant with a complexity comparable to Go look like? Simply increasing the board size is a very direct way to increase the complexity of the game, but this comes at the ...
hkBst's user avatar
  • 1,664
1 vote
0 answers
56 views

I am a 2300-rated FM in chess. Sometimes I want to know to know is this: what computing knowledge do you need to solve the game of chess? Does anyone know precisely?
chucknorris's user avatar
-2 votes
2 answers
111 views

Have chess science advanced enough to determine if there is a a chess side that always win if both sides are given unlimited time to think for the next move? Note the question Is not dumb as might ...
Exiltaran's user avatar
13 votes
3 answers
5k views

For example in the first turn there are 20 possible legal moves (16 pawn moves and 4 knights moves). This number increases in the middlegame and then decreases in the Endgame. Are there some ...
Superluminal's user avatar
  • 2,043
-1 votes
1 answer
156 views

Queen's Gambit Declined: Queen's Knight Variation, 3...Nf6 game for analysis. Here is the PGN [fen ""] [Event "Live Chess"] [Site "Chess.com"] [Date "2017.01.17"] [White "anandsadasivam"] [Black "...
Dev Anand Sadasivam's user avatar
5 votes
4 answers
495 views

While, I'm fully aware that the number of chess moves exceeds the number of atoms in the universe greatly, and so solving it is a problem that falls in NP, I was wondering if certain variations of it ...
Saikat's user avatar
  • 619
12 votes
4 answers
8k views

Why is Chinese chess (xiangqi) harder for computers than international chess? When one looks at Chinese chess in comparison to international chess, one cannot help but notice how extremely limited ...
hkBst's user avatar
  • 1,664
5 votes
3 answers
495 views

When reading annotated games from GMs, I sometimes find annotations such as "This was tried by XXX in 1975 vs YYY". Such annotations are sometimes found very deeply in the game, sometimes past move 20....
lindelof's user avatar
  • 559
7 votes
3 answers
2k views

The famous Shannon number, 10^120, an estimated lower bound on the number of possible chess games, is based on the assumption that a typical game lasts 40 moves. In games between skilled human ...
Dag Oskar Madsen's user avatar

15 30 50 per page