hackernews
ChessPositionRanking
hackernews | ChessPositionRanking | |
---|---|---|
13 | 29 | |
605 | 132 | |
- | - | |
0.0 | 2.5 | |
about 9 years ago | 5 months ago | |
Arc | Haskell | |
GNU General Public License v3.0 or later | 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.
hackernews
-
Can anyone tech me how to make a forum like this one
this might help a little: https://github.com/wting/hackernews
-
Ask HN: How is it possible to shop on Walmart.com? Everything is out of stock
I think it's a ratio of votes to time. I think as little as 4 votes can get something on the homepage if they come in fairly quickly.
The source code for hn is available if you want to go and look up the specifics. I'm not sure if this is the most up-to-date mirror, but the site doesn't change that often: https://github.com/wting/hackernews
-
Why Lisp Syntax Works
Might not count as modern, but the original Reddit and HackerNews codebases:
- https://github.com/reddit-archive/reddit1.0
- https://github.com/wting/hackernews (actually news.arc, based on old hn)
-
Ask HN: Is there an open-source HN forum clone?
There's also this https://github.com/wting/hackernews -- which is a version of the source code to the site from sometime in the past.
-
Whoops: Linux's Strcmp() for the M68k Has Always Been Broken
"Otherwise" was the operative word in my (slightly sarcastic) example. :)
Avoiding all caps words means you sometimes have to go back and change "FAA" back from "Faa".
HN's software is no longer open source, but at one time, this is how it processed titles on initial submission: https://github.com/wting/hackernews/blob/master/news.arc#L15...
-
U.S. appeals court rejects big tech's right to regulate online speech
And at any rate, #1 on HN is not the product of any simple rule like "most upvotes per unit time with some decay function applied." There is significant judgment in expressed in the way that stories are ranked. The sourcecode as of 2012 was enough to demonstrate this, but in my understanding yet more judgment has been applied since then.
https://github.com/wting/hackernews/blob/master/news.arc
-
Ask HN: How does HN manage to be always online?
"ad-hoc filesystem based solution" is the closest of your definitions, I think. Last time I saw/heard, HN was built in Arc, a Lisp dialect, and use(s/d) a variant of this (mirrored) code: https://github.com/wting/hackernews
Check out around this area of the code to see how simple it is. All just plain files. A database, of sorts, but not in the way you might be expecting: https://github.com/wting/hackernews/blob/master/news.arc#L16...
There is a modern maintained variant at https://github.com/arclanguage/anarki/tree/master/apps/news as well.
File syncing between machines is pretty much an easily solved problem. I don't know how they do it, but it could be something like https://syncthing.net/ or even some scripting with `rsync`. Heck, a cronned `tar | gzip | scp` might even be enough for an app whose data isn't exactly mission critical.
- Ask HN: Why are you programming your hobby projects in a niche language?
- News.Y Combinator.com/S.gif
-
Ask HN: How is HN internally structured?
The old version in arc, mirrored at https://github.com/wting/hackernews/blob/5a3296417d23d1ecc90..., uses the file system as a database.
https://github.com/wting/hackernews/blob/5a3296417d23d1ecc90... shows the monotonically increasing number:
(def new-item-id ()
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?
Hacker News API - Documentation and Samples for the Official HN API
kaldi-gstreamer-server - Real-time full-duplex speech recognition server, based on the Kaldi toolkit and the GStreamer framwork.
anarki - Community-managed fork of the Arc dialect of Lisp; for commit privileges submit a pull request.
FUZIX - FuzixOS: Because Small Is Beautiful
api - A RESTful API package for the Laravel and Lumen frameworks.
mtpng - A parallelized PNG encoder in Rust
nativefier - Make any web page a desktop application
swi-mqtt-pack - MQTT pack for SWI-Prolog
awesome-hacker-news - Awesome Hacker News: a collection of awesome Hacker News apps, libraries, resources and shiny things.
Etar Calendar - Android open source calendar
uBlock-issues - This is the community-maintained issue tracker for uBlock Origin
syzygy-tables.info - User interface and public API for probing Syzygy endgame tablebases