Hacker GitHub

← All repos

tromp/ChessPositionRanking

View on GitHub ↗ ★ 183 Haskell

Software suite for ranking chess positions and accurately estimating the number of legal chess positions

36 mentions on Hacker News by 7 people: 6 stories, 30 comments · first 2021-08-08 · latest 2026-01-28

Mentions per year 36 mentions · busiest year 2021 (15)
20082026
  1. …testing), not valid chess games (based on estimating branching factors for very long games). [0] https://github.com/tromp/ChessPositionRanking
    comment by LegionMammal978 · 2026-01-28 · in How many chess games are possible?
  2. …one can make (until the encoding just becomes an index in the set of all unique db positions). [1] https://github.com/tromp/ChessPositionRanking
  3. …> By checking all approximately 8.7x10^45 reachable chess positions? That's a large overestimate. https://github.com/tromp/ChessPositionRanking accurately estimates the number of legal chess positions at ~4.8x10^44.
  4. …to one side's advantage, as is clear from sampling a few dozen random legal positions. [1] https://github.com/tromp/ChessPositionRanking
    comment by tromp · 2024-12-09 · in How God Plays Chess (2018)
  5. …for distinguishing their quality, since usually one side already has an overwhelming advantage. [1] https://github.com/tromp/ChessPositionRanking
  6. …positions that might or might not be legal. [1] https://github.com/peterosterlund2/texel [2] https://github.com/tromp/ChessPositionRanking
  7. …illegal positions like https://chess.maxmcd.com/rnbqkbnr/qqqqqqqq/8/8/8/8/QQQQQQQQ/... as well. [1] https://github.com/tromp/ChessPositionRanking
    comment by tromp · 2024-05-14 · in Static Chess
  8. …must be reachable by a sequence of legal moves from the starting position, however dumb), see https://github.com/tromp/ChessPositionRanking . You can probably filter their sample by number of pieces to gain pretty accurate estimations for…
    comment by Sesse__ · 2024-04-03 · in Los Alamos Chess
  9. …over legal moves. Related: accurately estimating the number of legal positions of chess [1]. [1] https://github.com/tromp/ChessPositionRanking
  10. …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.
  11. …in log_2(8726713169886222032347729969256422370854716254) ~ 152.6 bits ~ 19.1 bytes using rankings: https://github.com/tromp/ChessPositionRanking But the major point of this project is to allow for random sampling of positions with a decent…
  12. …how many are legal, and thus obtain an accurate estimate of 4.8 * 10^44 legal chess positions. [1] https://github.com/tromp/ChessPositionRanking/blob/main/src/... [2] https://github.com/tromp/ChessPositionRanking
  13. …[3] https://tromp.github.io/go.html [4] https://tromp.github.io/go/legal.html [5] https://github.com/tromp/ChessPositionRanking#readme
  14. …build a tree with all legal chess positions, it would have approximately 4.8x10^44 of them [1]. [1] https://github.com/tromp/ChessPositionRanking
  15. …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…
    comment by Sesse__ · 2022-07-03 · in How to build a chess engine
  16. …their legality [4] allowed us to estimate the number of legal chess positions as ~ 4.8 * 10^44. [1] https://github.com/tromp/ChessPositionRanking/blob/main/src/... [2] https://hackage.haskell.org/package/simple-enumeration-0.2/d... [3]…
  17. …number of legal chess positions has now been estimated with 2 digits of accuracy as ~ 4.8 x 10^44: https://github.com/tromp/ChessPositionRanking For the game of Go, we know all 171 digits of the number: https://tromp.github.io/go/legal.htm
    comment by tromp · 2022-04-30 · in Ask HN: Teach me something new
  18. …positions, in Haskell because of the ease of building powerful abstractions like a Ranking [2]. [1] https://github.com/tromp/ChessPositionRanking [2] https://github.com/tromp/ChessPositionRanking/blob/main/src/...
  19. Github user @Ananas1729 (Ben Jones) found another at https://github.com/tromp/ChessPositionRanking/issues/243
  20. And yet another at https://github.com/tromp/ChessPositionRanking/issues/186
  21. And another at https://github.com/tromp/ChessPositionRanking/issues/111
  22. And another at https://github.com/tromp/ChessPositionRanking/issues/476#iss...
  23. …use IO (), while the other approximately thousand lines of code have nothing to do with IO (). [1] https://github.com/tromp/ChessPositionRanking
  24. Peter Osterland found yet another misclassification in https://github.com/tromp/ChessPositionRanking/issues/824
  25. …the two misjudgements cancel out and the original 538 count currently still stands. Lovely:-) [1] https://github.com/tromp/ChessPositionRanking/issues/794
  26. A misclassified issue was found by Github user 1pab42 at https://github.com/tromp/ChessPositionRanking/issues/878 That changes the prospective number of legal positions to 539...
  27. …issue, I was surprised to not find the position among the open issues. In fact it was closed as https://github.com/tromp/ChessPositionRanking/issues/915 So I had classified it correctly, but only AFTER making the diagrams for the 1k…
  28. …the en-passant positions in the 919-93 positions not from the smaller 1k sample, such as this one: https://github.com/tromp/ChessPositionRanking/issues/916 I'll have to make some changes to my README. Meanwhile, congratulations on spotting…
  29. …let you draw a random sample to determine the fraction of legal ones, as needed for estimation. [1] https://github.com/tromp/ChessPositionRanking/blob/main/src/... [2] https://github.com/tromp/ChessPositionRanking/blob/main/src/... [3]…
  30. I wrote a nontrivial Haskell application this year [1] and use exactly 0 language extensions. [1] https://github.com/tromp/ChessPositionRanking/tree/main/src/...
    comment by tromp · 2021-08-31 · in Brooks, Wirth and Go