Which, to be fair, is also derived from a word which would be most accurately (with English vowels) pronounced as mah-nuh. Although at this point “manna” is definitively also a word of English whose correct pronunciation is with /æ/.
Programmer, graduate student, and gamer. I’m also learning French and love any opportunity to practice :)
Which, to be fair, is also derived from a word which would be most accurately (with English vowels) pronounced as mah-nuh. Although at this point “manna” is definitively also a word of English whose correct pronunciation is with /æ/.
I’ve only ever seen “one-time” in cryptography to refer to One-Time Pads (OTP). They are literally uncrackable (because every possible plaintext could be encoded by every possible ciphertext) but they achieve that by using a shared private key. The cipher becomes attackable if the key is re-used, hence the “one-time.”
But that key has to be exchanged somehow, and that exchange can be attacked instead. Key exchange algorithms can’t necessarily transfer every possible OTP which means eavesdropping on the exchange would make an OTP attackable. So the best option we know of that doesn’t require secret meetings to share OTPs* really is to use RSA encryption. Once we have efficient quantum-resistant schemes, they’ll be the best option we know.
* and let’s be honest, secret meetings can be eavesdropped on as well.
Bril is the only compiler IL I know of that is specifically designed for education.
R. Kent Dybvig’s compilers course has had approximately 15 “intermediate” representations designed for his course since at least 2004 – a consequence of teaching the course using the nanopass compiler framework for scheme. You could broadly divide these into “representations that are restrictions of scheme,” and “representations that are increasingly-annotated versions of UIL” where UIL is the underlying intermediate representation. As far as I know, UIL was also designed for this course.
How does this compare with GumTree? It’s weird that the page doesn’t even mention existing state-of-the-art tools for this task.
Most recently, KeyWe and modded Keep Talking with friends. Solo, still ol’ reliable slay the spire.
I have a plan to teach someone how to play schnapsen and crazyhouse chess tomorrow so that’s exciting.
I find there’s a lot less variety in my monster train runs. Most classes have a distinctly best strategy and the artifacts generally also funnel you towards that strategy. For example, I can’t remember the last time I played an Umbra run that didn’t set up a morsel engine behind a warden or alloyed construct - as far as I’m concerned, those are the same strategy, it doesn’t feel different. The only other build I think is viable is just “play Shadowsiege,” which rarely happens early enough to build for it.
Every class in STS has at least three viable archetypes and almost every run within those archetypes still feels different to me.
I almost exclusively play for A20 heart kills. I play all 4 classes but in a “whichever I feel like today” way. I tried rotating between the characters for a while and really didn’t enjoy playing silent or watcher while in the wrong mood for those classes.
My favorite deck in recent memory was probably a silent discard combo with Grand Finale as the only damage-dealing card in the deck. My favorite archetype in general is probably ice defect. A good all-you-can-eat ironclad run is great too.
I don’t think I agree that STS is especially well balanced - some regular hallway combats do irrationally more damage on average even to players much better than me (for example, floor one jaw worms or any act 3 darklings). In general, the game could be quite a bit harder on A20 and still be fun for players who want a challenge. It’s also weird to me that A1 makes the game easier compared to A0. Between the classes, there is a class which is clearly stronger than the others. However I also don’t think this is a bad thing. Imbalances create more opportunities for new experiences, and for different kinds of players to have different kinds of fun. And that certainly agrees with “infinite replayability.” I’m sure in 5 years’ time I will still be seeing interactions I’ve never seen before.
Second Shadow of the Colossus. The moments where you can just sit and look, coupled with the soundtrack, are some of the best in gaming history. Plus that bit of tension knowing what you’re about to get into…
Not only is tunic beautiful; the experience is amazing. It’s even better if you try to solve the main optional puzzle as you go.
Definitely agree that it’s one of the best.
Some of these depend on dialect - where my family is from, gaunt and aunt rhyme, for example.
Of course, that makes it worse, not better :P
Only the number of shuffles is linear. Shuffling an array and marking/deleting correctly-placed elements still take linear time even with a “placement oracle.” It’s at best O(n^2) so the algorithm still wouldn’t be a good sorting algorithm.
It’s like doing selection sort, except we’re selecting a random set of elements (from that poisson distribution) instead of the smallest one.
I’m not sure the median is what you want. The worst case behavior is unbounded. There is no guarantee that such an algorithm ever actually terminates, and in fact (with very low probability) it may not! But that means there is no well-defined median; we can’t enumerate the space.
So let’s instead ask about the average, which is meaningful, as the increasingly high iteration-count datapoints are also decreasingly likely, in a way that we can compute without trying to enumerate all possible sequences of shuffles.
Consider the problem like this: at every iteration, remove the elements that are in the correct positions and continue sorting a shorter list. As long as we keep getting shuffles where nothing is in the correct position, we can go forever. Such shuffles are called derangements, and the probability of getting one is 1/e. That is, the number of derangements of n items is the nearest integer to n!/e, so the probability of a derangement would be 1/n! * [n!/e]. This number converges to 1/e incredibly quickly as n grows - unsurprisingly, the number of correct digits is on the order of the factorial of n.
We’re now interested in partial derangements D_{n,k}; the number of permutations of n elements which have k fixed points. D_{n,0} is the number of derangements, as established that is [n!/e]. Suppose k isn’t 0. Then we can pick k points to be correctly sorted, and multiply by the number of derangements of the others, for a total of nCk * [(n-k)!/e]. Note that [1/e] is 0, indeed, it’s not possible for exactly one element to be out of place.
So what’s the probability of a particular partial derangement? Well now we’re asking for D_{n,k}/n!. That would be nCk/n! * [(n-k)!/e]. Let’s drop the nearest integer bit and call it an approximation, then (nCk * (n-k)!)/(n! * e) = 1/(k!*e). Look familiar? That’s a Poisson distribution with λ = 1!
But if we have a Poisson distribution with λ = 1, then that means that on average we expect one new sorted element per shuffle, and hence we expect to take n shuffles. I’ll admit, I was not expecting that when I started working this out. I wrote a quick program to average some trials as a sanity check and it seems to hold.
Yeah i think you found the boss on accident if that’s the quest name you were seeing.
But so did I, so this can’t be that uncommon. I question the design of having some mid-game content in the same (surface) place as the end-game because it becomes unclear what you’re being pointed at. Put simply, tell me to walk towards the giant chasm; I’m jumping in.
I realized I wasn’t supposed to be there yet when I recognized a typical pre-boss pattern that Zelda games use a lot. Trying to avoid spoilers there.
Patrick’s parabox?
Shadow of the Colossus and Undertale.
Yeah, these are examples of the bad gameplay patterns I was referring to. One of them in particular (trying to be spoiler-light) provides you a ranged power… But you have to go to melee range to activate it. Whose idea was that?
Casually, I enjoyed it a lot. It felt like better BOTW, with much more new stuff to explore than I expected. My only gripes where the delay on quick menus (botw did not have that, and it feels awful) and I generally think the sage mechanic leads to bad play patterns. But overall, it’s amazing.
I’ve been involved in speedrunning both games. Versioning issues in TOTK are way worse. Movement tech in botw was a lot more interesting and varied, until windbombs were found anyway. The menu lag feels even worse while speedrunning. The stuff we’ve got for inside shrines is pretty cool, and there’s some very cool out-of-bounds stuff found already. So it’ll probably stay fresh for a while. I’m not sure if it’ll hold me for as long as botw did though.
But that feels terrible if you want to follow them without stopping (or in the case of obstacles, are able to).
Even Ocarina of Time, in 1998, got this right. The Dampe race, which isn’t technically an escort, would feel weird if Dampe was too much faster or slower than you, because it would feel unfair. But not everyone moves as fast while playing - some people like rolling, which is a different speed from walking, etc. Also, he throws fireballs at you, and players who are less good at dodging them will end up being slower. So Dampe doesn’t “follow you,” (in fact, he spends most of the thing in front of you), but he has a rubber band effect. If you get too far behind, he slows down. If you get too far ahead, he speeds up. This does a good job of keeping him in view, which helps give the feeling that you’re going at an intended pace, whatever reasonable pace you take. If you’re too slow, you will fail, but… it pretty much requires standing still or getting hit by lots of fireballs.
In contrast, the Yunobo escort in BOTW feels terrible casually and even worse to speedrun. He’s faster than you walk, but much, MUCH slower than you run. And if you get too far ahead of him? He stops.
Join us in speedrunning and have your life consumed forever :)
“Monadic type” has something like three meanings depending on context, and it’s not clear which one you mean. One of them is common in math, but not so common in programming, so probably not that. But neither “parametric types with a single argument” nor “types that encode a category-theoretic monad” have the property you say, as far as I know.
I imagine you’re probably referring to the latter, since the optional monad exists. That’s very different from returning null. The inhabitants of
Integer
in Java, for example, are the boxed machine ints andnull
. The inhabitants ofOptional[Integer]
(it won’t let me use angle brackets here) areOptional.of(i)
for each machine inti
,Optional.empty()
, andnull
.Optional.empty()
is not null and should not be called a “Null object.” It’s also not of typeInteger
, so you’re not even allowed to return it unless the function type explicitly says so. Writing such function types is pretty uncommon to do in java programs but it’s more normal in kotlin. In languages like Haskell, which don’t havenull
at all, this is idiomatic.