syzygy-tables.info
ChessPositionRanking
| syzygy-tables.info | ChessPositionRanking | |
|---|---|---|
| 15 | 29 | |
| 59 | 132 | |
| - | - | |
| 7.7 | 2.5 | |
| about 2 months ago | 5 months ago | |
| Python | Haskell | |
| GNU Affero General Public License v3.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
syzygy-tables.info
- TIL that chess is completely solved with 7 pieces(any combinations) left on the board. This solution is stored in a database table that's 17 terabytes in size.
-
Is this a draw?
If both sides play correctly, yes this is a draw. Chess is solved with fewer than 7 pieces on the board. At this website, you can check any such position and see what the result will be, assuming perfect play from both sides
-
Chess, unlike war, is a game of perfect information
There is some truth to this.
In theory, chess is a game of perfect information.
But in practice, this is only true for ~6-piece endgames: every outcome has been / can be computed. But for any middle- or early-game position, the amount of finite information greatly exceeds any person's or computer's capacity, practically speaking.
In concrete terms, the tablebase for 6-piece endgames is ~150 GiB. For 7-piece, it's 16 TiB.
[1] https://syzygy-tables.info/
-
Sechs Jahre nach AlphaGo: Mensch besiegt erneut "zuverlässig" stärkste Go-KIs
Syzygy-Tables https://www.chessprogramming.org/Syzygy_Bases
- Syzygy Endgame Tablebases
-
Analysis board, practicing with the computer settings.
Alternatively, if you're playing an endgame with seven or fewer pieces, I suggest you use the Syzygy 7-piece tablebase to get the objectively best response on every move.
- This puzzle a master showed me today. Can you find the mate in 2?
- Syzygy Chess Endgame Tablebases
-
White to move and mate in 584 (longest forced mate ever found)
I suppose you mean the syzgy 7 man tablebases? Yes, they do take 50MR into account because they use DTZ metric (fastest way to checkmate, capture or pawn move).
-
What is the longest possible forced mate sequence with K - K + Q on the board? I managed to find a #10 at most but I suspect that you can get more. Has this been investigated?
I'd assume that Stockfish just hasn't found the M9. Tablebases already know the quickest mates in a given position, you can check the tablebase here
ChessPositionRanking
- Chess Position Ranking
-
How to Store a Chess Game in 26 Bytes Using Bit-Level Magic
3. There's extra nuanced things you might want to handle in the coding, like that pawns can't be on their own back row. That is significantly harder.
It looks to me like https://github.com/tromp/ChessPositionRanking has resolved these sorts of issues, but I haven't dug into exactly how.
-
Permutation Iteration and Random Access
Multinomial rankings can be combined with a dozen others to rank a subset of all chess positions including all legal ones. This allows one to sample millions of random such positions, determine how many are legal, and thus obtain an accurate estimate of 4.8&10^44 legal chess positions [2].
[1] https://github.com/tromp/ChessPositionRanking/blob/main/src/...
[2] https://github.com/tromp/ChessPositionRanking
-
The number of legal Chess diagrams is less than 4 × 10^37 which is an improvement on the previous upper bound of 2 × 10^40 by Steinerberger.
The key words being "without promotion". Both bounds, this one and Steinerberger's, only consider positions reachable without promotion. Allowing promotions, one estimate suggests that the number is close to 4.82 × 10^44.
-
eli5 With billions and billions of people over time, how can fingerprints be unique to each person. With the small amount of space, wouldn’t they eventually have to repeat the pattern?
source
- Accurately estimating the number of legal chess positions
-
"Chess too simple for my big brain, not like mobile strategy game"
This one as well as Shannon number wiki seem to say that possible sensible moves are about 10^40 while and 10^120 while taking any moves (maybe including some illogical / illegal ones) .
-
How to build a Chess Engine, an interactive guide
Shannon's estimate was based on very primitive methods; by generating random positions and using fairly advanced methods to see whether they are legal or not (ie., can you construct a proof game for it, or prove that it could never happen), you will get much closer. A group of people have been working on this, and their current best estimate is (4.822 +- 0.028) * 10^44, or a bit over 148 bits. (Amazingly enough, Shannon wasn't all that far off on this account! His estimated number of legal games seems much more dodgy, though.)
http://talkchess.com/forum3/viewtopic.php?f=7&t=77685&sid=e3...
Practically speaking, https://github.com/tromp/ChessPositionRanking gives a number between 0 and approx. 8.7 * 10^45 for any legal position, so it's only a couple of bits away from optimality.
-
Ask HN: Teach Me Something New
The number of chess positions has now been estimated with 2 digits of accuracy as ~ 4.8 x 10^44: https://github.com/tromp/ChessPositionRanking
What are some alternatives?
python-chess - A chess library for Python, with move generation and validation, PGN parsing and writing, Polyglot opening book reading, Gaviota tablebase probing, Syzygy tablebase probing, and UCI/XBoard engine communication
kaldi-gstreamer-server - Real-time full-duplex speech recognition server, based on the Kaldi toolkit and the GStreamer framwork.