rand-vars VS ChessPositionRanking

rand-vars

We haven't tracked posts mentioning rand-vars yet.
Tracking mentions began in Dec 2020.

ChessPositionRanking

• Chess Position Ranking
  1 project | news.ycombinator.com | 6 Nov 2023
  1 project | news.ycombinator.com | 24 May 2022
• How to Store a Chess Game in 26 Bytes Using Bit-Level Magic
  2 projects | news.ycombinator.com | 15 Sep 2023

  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
  4 projects | news.ycombinator.com | 23 Aug 2023

  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.
  1 project | /r/chess | 20 Mar 2023

  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?
  2 projects | /r/explainlikeimfive | 2 Jan 2023

  source

• Accurately estimating the number of legal chess positions
  1 project | news.ycombinator.com | 23 Dec 2022
• "Chess too simple for my big brain, not like mobile strategy game"
  1 project | /r/Gamingcirclejerk | 24 Oct 2022

  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
  5 projects | news.ycombinator.com | 2 Jul 2022

  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
  8 projects | news.ycombinator.com | 29 Apr 2022

  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