opus
ChessPositionRanking
opus | ChessPositionRanking | |
---|---|---|
26 | 29 | |
2,103 | 132 | |
1.3% | - | |
9.6 | 2.5 | |
7 days ago | 5 months ago | |
C | 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.
opus
-
TSAC: Low Bitrate Audio Compression
Opus doesn't support 44.1 kHz because compatibility and effort/benefit ratio:
https://github.com/xiph/opus/issues/43
The browser audio limitation is presumably a workaround to some bug or performance limitation that was relevant at some point in history (the site was created in 2014).
-
Permutation Iteration and Random Access
There is a pattern here (that also goes with the author's prior article on inverting gauss' sum formula): Generally if if you can make a formula that counts the combination of things you can convert that into a code to encode and decode those combinations into indexes.
So for example the opus audio codec needs to encode/decode vectors of dimension n whos absolute values sum to k. https://github.com/xiph/opus/blob/master/celt/cwrs.c#L74
Or this rolling cuckoo filter that optimally encode/decode four sorted numbers in a range 0..2N with the constraint that the they span a range of N. https://github.com/sipa/bitcoin/blob/202006_cuckoo_filter/sr...
If you're lucky there will be closed form expressions for the encoding and decoding equations. (There for both of the above, at least for some parameters, but in both those examples the implementations use small tables because for the ranges involved the tables end up being faster than sqrts).
-
A CPU in Sunvox
Too bad 10Hz is a too slow to generate audio-rate bitops music.
(e.g. https://github.com/xiph/opus/blob/master/tests/test_opus_enc... )
- L’avenir de la loi Hadopi suspendu à une décision de la justice européenne
-
Global Underground Disk Images
Could anyone help me get a disk image files for older Global Underground CDs? I encoded my old CDs into subpar mp3 files, and I'd now like to have high-quality Opus encodings and experiment across various bitrates.
-
Which is better Opus or AC3?
Presumably, OP is referring to the Opus audio codec versus Dolby's AC3 codec.
-
HD: Opus?
Indeed. https://opus-codec.org/
-
Multiple tags with the same name in metadata
If there are multiple tags with the same name, Ffmpeg will only use the last tag. If you really need to have multiple tags with the same name in your OPUS files, use opusenc instead (https://opus-codec.org/). Beware that some playback software does not display multiple artists gracefully.
-
I built a Zoom clone 100% IN RUST
AFAIK ogg isn't really suitable for low latency audio streaming. Consider the Opus codec instead.
-
ffmpeg libopus producing larger file size for the same bitrate as compared to vorbis
I have asked on GitHub also https://github.com/xiph/opus/issues/263 in anyone wants to respond there.
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?
libvorbis - Haskell binding for libvorbis, for decoding Ogg Vorbis audio files
kaldi-gstreamer-server - Real-time full-duplex speech recognition server, based on the Kaldi toolkit and the GStreamer framwork.
go-m3u8 - Parse and generate m3u8 playlists for Apple HTTP Live Streaming (HLS) in Golang (ported from gem https://github.com/sethdeckard/m3u8)
hackernews - Hacker News web site source code mirror.
argos-translate - Open-source offline translation library written in Python
FUZIX - FuzixOS: Because Small Is Beautiful
vorbis - Reference implementation of the Ogg Vorbis audio format.
mtpng - A parallelized PNG encoder in Rust
vgmstream - vgmstream - A library for playback of various streamed audio formats used in video games.
swi-mqtt-pack - MQTT pack for SWI-Prolog
libopenaptx - Open Source implementation of Audio Processing Technology codec (aptX)
Etar Calendar - Android open source calendar