Sesse__

41 ms·

691.
by Sesse__ 2y ago
Username checks out. :-)
692.
by Sesse__ 2y ago
Uh, why? Why would I need to go through a different procedure between each entity I want to pay? After all, the point of a bank is to make unified transfer procedures between entities.
693.
by Sesse__ 2y ago
Wait, you need to go to a website to pay your electric bill? Mine is auto-deducted from my bank (up to a certain monthly maximum that I have set myself). You get bills directly in your bank, and then approve (possibly allowing auto-deductio
694.
by Sesse__ 2y ago
Linking to the latest version of glibc is, in itself, not a problem -- glibc hasn't bumped its soname in ages, it is using symbol versioning instead. So you only get a problem if you use a symbol that doesn't exist in older glibc
695.
by Sesse__ 2y ago
The half-move counter in the FEN takes care of the 50/75 move rule. You do need the history if you want to implement the threefold/fivefold repetition rule, but it's rare that it is actually relevant for e.g. a chess engine&#
696.
by Sesse__ 2y ago
You don't need to resign a game to enter analysis mode. It's available from the menu.
697.
by Sesse__ 2y ago
The entire point of a FEN is that it describes the entire board state without having to know anything about the history. > Which of course is annoying to implement, but you do already have to keep state on the history of the game to dete
698.
by Sesse__ 2y ago
One of the rooks might move over to the other side during the course of the game, and then it's no longer unambiguous which one is the castling rook. E.g., if you have your king on e1, a rook on f1 and another one on g1… can you castle
699.
by Sesse__ 2y ago
> You can't uniformly sample an unbounded set. You definitely can, as long as you are accepting the use of limits (and without that, sampling uniform over any subsegment over the reals would also be pretty much impossible). “Sample
700.
by Sesse__ 2y ago
> Not an issue for sqlite, potentially disastrous for mysql. MySQL _completely_ switched execution paradigm through the course of a couple of 8.0.x sub-releases, generally without anyone noticing.
701.
by Sesse__ 2y ago
> Also, most SQL plans are trees (Until you get to WITH RECURSIVE). WITH RECURSIVE can also generally be implemented tree-style, you just loop a bunch in one of the iterators. There are some databases, like Umbra, which can have DAG quer
702.
by Sesse__ 2y ago
Note that this only holds true for fairly recent MySQL (MySQL 8.x, not including the oldest 8.0.x releases). 5.7 and older, and by extension MariaDB, instead models pretty much everything as a large fixed-function recursive function that ca
703.
by Sesse__ 2y ago
No, it was not taken as a given, it was an example of a very common product that digital image sensors enabled. I could have chosen e.g. digital cinema cameras, but they would not nearly have the same profound effect as cell phone cameras h
704.
by Sesse__ 2y ago
The theory of relativity does not in any way enable GPS. GPS is subject to (some) relativistic effects, but that is merely a source of bias, which could be corrected for with just an experience-based correction factor even if we did not und
705.
by Sesse__ 3y ago
Having a foreign key should probably be a hint to the planner that it should create a cross-table correlation estimate on the source and destination columns. This is about join cardinality estimation, not having an index.
706.
by Sesse__ 3y ago
Postgres is a fairly standard System R implementation. You convert your SQL into a join tree with some operations at the end, and then try various access paths and their combinations.
707.
by Sesse__ 3y ago
In many languages, you can't just optimize + b - b willy-nilly, as there could be side effects and non-obvious interactions abound. For instance, in JavaScript, where everything is a 64-bit double, a + b - b is definitely not the same
708.
by Sesse__ 3y ago
Postgres isn't really hot on implementing the latest stuff from academia (most of what they do seem to be fairly home-grown, not the least because some of it was never really written about before they started doing it). Arbitrary unnes
709.
by Sesse__ 3y ago
No, it optimizes cost, which includes pages read from disk _and_ things like CPU use. Cost is an arbitrary unit meant to correlate with time spent, not by disk loads, so it's completely reasonable to compare plans with everything loade
710.
by Sesse__ 3y ago
Positive finite floats compare like ints. If you can have negative values, things get slightly more complicated, since they use sign-magnitude (you basically shift the sign bit to the right and use that as an XOR mask on all the other bits)
711.
by Sesse__ 3y ago
If the set of cities is known (as your binary search algorithm assumes), you can insert all of them first, on the CPU. That will resolve all collisions ahead of time, making the structure of the hash table essentially read-only. (Of course,
712.
by Sesse__ 3y ago
“While I’ve not found a description of exactly when and how Luciano Bello discovered the vulnerability that became CVE-2008-0166 […]” From my IRC logs at the time: 17:23 < luciano> has really an accident. I was needing many primes
713.
by Sesse__ 3y ago
No, it states that wrangling _can be_ encoding. It does not in any way state that Wuffs is actually _good_ for it at the current stage, and I do not know of any nontrivial encoder built with Wuffs, ever. (In contrast, there are 18 example d
714.
by Sesse__ 3y ago
Ideally, the decoder should be dithering, I suppose. (I know of zero JPEG decoders that do this in practice.)
715.
by Sesse__ 3y ago
Wuffs is for the exact _opposite_ purpose (decoding). It can do simple encoding once you know what bits to put in the file, but a JPEG encoder contains a lot of nontrivial machinery that does not fit well into Wuffs. (I work at Google, but
716.
by Sesse__ 3y ago
It doesn't really matter, since every position with 24 pieces can change into one with fewer. So you need the sum of all of those values. For a more sophisticated estimation of the number of legal positions, taking into account _true_
717.
by Sesse__ 3y ago
I'm not sure if you can call it “completely solved” if it's only weakly solved, but sure. It's a different goal (and my answer was a response to a “can't we just build a tablebase” comment).
718.
by Sesse__ 3y ago
Well, it helps if you can meet-in-the-middle, roughly. And it helps a _lot_ to do a weak solve, i.e., you don't care about winning won positions, only showing a draw with perfect play.
719.
by Sesse__ 3y ago
Basically anything where a bishop would win, but a queen would put the other side in stalemate. For an extreme example, see https://en.wikipedia.org/wiki/Babson_task .
720.
by Sesse__ 3y ago
Humans are probably worse with knights than any other piece, relative to computers. Queen is a possible second; queen endgames are super-complex for humans since there are so many options and very few of them can be easily pruned. (I guess

More ›