Sesse__

6 ms·

91.
by Sesse__ 7mo ago
> There are more errors in the text It seems most of it is AI-generated, without any real attempt at cleaning up errors.
92.
by Sesse__ 8mo ago
Or use a cycle timer and run a PRNG from it. Or wait for us to launch random() :-) (It's in development, available if you enable a flag)
93.
by Sesse__ 8mo ago
IIRC, it's this paper: https://db.in.tum.de/~birler/papers/hashtable.pdf I never implemented their hash table, but it opened my eyes to the technique of a tiny Bloom filter, which I've used now a couple
94.
by Sesse__ 8mo ago
> Overall, I think block bloom filters should be the default most people reach for. I think this depends on how big your filters are. Most people think of Bloom filters as having to have hundreds of thousands of elements, but I frequentl
95.
by Sesse__ 8mo ago
You probably want git-dmb (dmb = delete merged branches) for a safe and more comprehensive way of dealing with this.
96.
by Sesse__ 8mo ago
> My counter argument is that games on lichess against stockfish don't imply a human beat stockfish. It could just be that stockfish (or other bots) can sometimes beat stockfish. And some humans surely use bots to play on their beha
97.
by Sesse__ 8mo ago
Originally Freestyle Chess referred to something else entirely, namely “anything goes” online chess: https://en.chessbase.com/post/scintillating-che-in-the-pal-c... You were allowed to use engines, opening books and ta
98.
by Sesse__ 8mo ago
People have already built Chess960 opening books.
99.
by Sesse__ 8mo ago
For reference: The last serious match between the top human player and an engine was Brains in Bahrain, Kramnik–Fritz 7, in 2002 (already that should tell you something). Well, actually a broken and buggy version of Fritz 7, but that's
100.
by Sesse__ 8mo ago
You can build fiber basically arbitrarily solid. A normal patch cable won't be that solid, but the more rugged trunk cables is something like (just pulling out of a data sheet for something I used a while back): * Outer diameter: 6
101.
by Sesse__ 8mo ago
It also makes no sense to me, and I also have a DSP degree. Of course moving averages (aka box blurs) filter out higher frequencies more than middle frequencies.
102.
by Sesse__ 8mo ago
> they need to be synchronized to the level that audio matches up correctly, which is much more precise than video as audio uses sample frequencies in the 48Khz-96Khz range, whereas video of course is typically just 60Hz Typically video
103.
by Sesse__ 8mo ago
Also, I guess we traded a ton of coax cable for somewhat more manageable single-mode fiber. :-) I never fully understood why SDI over fiber remains so niche, e.g. UHD people would rather do four chunky 3G-SDI cables instead of a much cheape
104.
by Sesse__ 8mo ago
> it seems like no solution is perfect, and the main tradeoff from that authors perspective is bandwidth requirements for UHD. The “no standalone switch can give enough bandwidth” issue has generally been solved since that page was writt
105.
by Sesse__ 8mo ago
Generally NDI is not widely used in professional AV. There's a fair bit in prosumer, and a _little_ bit in the low end of pro. But the fact that it's a proprietary protocol (they can claim it's “open” all they want, but the S
106.
by Sesse__ 8mo ago
It generally also needs help from the NIC, to pace out the packets at the right timestamps. (Typically delivered as part of said bypass technologies.)
107.
by Sesse__ 8mo ago
Just so that my wrongness isn't there for posterity: This is wrong for a real-valued signal (which is what we're discussing here). I had forgotten about the negative frequencies. So there _is_ a mirror coming from the upsampling.
108.
by Sesse__ 8mo ago
And also, to add to the actual GBA discussion: If you think the resulting sound is too muffled, as many here do, you can simply substitute a filter with a higher cutoff (or less steep slope). E.g., you could use a fixed 12 kHz lowpass filte
109.
by Sesse__ 8mo ago
I think I've heard the word “images” being used for these copies, yes. Interpolation is a bit of a confusing topic, because the most efficient implementation is not the one that lends itself the easiest to frequency analysis. But prett
110.
by Sesse__ 8mo ago
It's actually the other way round: Aliasing fills the lower frequencies with a mirror image of the higher frequencies. So where do the higher frequencies come from? From the upsampling that happens before the aliasing. _That_ makes the
111.
by Sesse__ 8mo ago
> If they'd packed everything into one HAL, single-processor systems would have to take the performance hit of all the synchronization code even though it wasn't necessary. Memory usage would be higher too. Linux also used to b
112.
by Sesse__ 8mo ago
It also probably is hard even to get the SQLite _executor_ to accept these plans, given that they are not trees. It feels a bit odd that none of the papers seem to really talk much about this; they have an algebraic tree structure and then
113.
by Sesse__ 8mo ago
I cannot answer for their future plans, but in general, SQLite doesn't seem to be focusing on this kind of analytical workload at all. DuckDB would be a more likely bet in that space.
114.
by Sesse__ 8mo ago
Is that right? There were devrooms for GCC, Go, LLVM, Nix, Plan 9, Python and many more.
115.
by Sesse__ 8mo ago
> It also has an advanced query planner that embraces the latest theoretical advances in query optimization, especially some techniques to unnest complex multi-join query plans, especially with queries that have a ton of joins. The TUM g
116.
by Sesse__ 8mo ago
What if the players are both much higher-rated than the arbiter? Basically, once you've lost on time, you're giving up the right to any sort of agency, and thus the Elo doesn't matter. The rules are charitably giving you a ra
117.
by Sesse__ 8mo ago
Endgame tablebases don't take into account threefold repetition; if so, you would have to basically be able to exclude any arbitrary position from the tree, which would seem impossible. The 50-move rule is respected by the Syzygy table
118.
by Sesse__ 8mo ago
Here's an actual constructed game that is presumably as long as possible (with explanation): https://www.reddit.com/r/chess/comments/168qmk6/longest_poss...
119.
by Sesse__ 8mo ago
The oldest rules on FIDE's pages are the ones for “before 2014”. They state: The game is drawn when a position has arisen in which neither player can checkmate the opponent’s king with any series of legal moves. The game is said to
120.
by Sesse__ 8mo ago
Is that a new rule? I was under the impression that it had been the case for a very long time that if you went out on time but there was no possible sequence of moves leading to checkmating you, it was a draw instead. (Meaning, of course,

More ›