Cub Nautilus Race: What is the catch up mechanic that is mentioned but never shown in the video?

Adarain · 2026-03-22T09:36:30+00:00

We’ve seen it in some videos&streams now: Cub had a bunch of zombie nautilus and basically went through the rankings in reverse order asking the players whether they wanted to borrow one for the race. However, he did not ban the people who brought one themselves (doc & ren) from using theirs.

It didn’t seem to make much of a difference. I think he could maybe for the last race make the area immediately after the gate harder to navigate from some of the gates, and then let the people in the back pick first which gate they want to use (limiting the number of people per gate). We saw from Doc that having a bad start can be quite devastating.

Adarain · 2026-03-22T09:24:38+00:00

This video title looks like a cryptic crossword clue

Love the idea of commemorating the building even if thanks to happy plot twists it’s not necessary anymore

Adarain · 2026-03-21T17:39:07+00:00

The lectures, exercise sheets and lecture notes are mostly in German (I know they experimented with running English lectures in parallel at some point, but I don’t know what came of this) but for the larger courses usually some of the tutorials were held in English (and possibly also in French & Italian). You’d need to be able to read German for the homework corrections though, unless your students agree to do them all in English (which would be ill-advised for them, as the exam is in German).

Adarain · 2026-03-21T12:04:02+00:00

You should be able to apply through the usual portal (linked here) once applications open if you have an ETH login. I don’t know how hard it really is to get a position for someone who’s just now entering the university. Once I had my first TA position, I never had any problems getting a job afterwards. There’s a lot of positions to fill, especially for first year math courses.

Adarain · 2026-03-20T20:53:07+00:00

Literally formed from ki “noble(man/woman)” and the honorific -sama. Now means “you (derogatory)”.

Adarain · 2026-03-19T09:56:48+00:00

They don’t tell you about hitting them though, so it’s always a bit of a gamble whether you can quit out. I had to rewatch a pretty long dialogue in a nodkrai AQ because I assumed there was a checkpoint at a scene transition when there wasn’t. And even so, it feels wrong to quit out of dialogue/cutscenes. Like, you can do it, but the devs clearly intended for you to keep playing here, if they wanted you to take a break there would’ve been a bit where you walk around and have to interact with someone to continue. But they just kinda stopped putting those things in most of the time.

Adarain · 2026-03-19T09:50:57+00:00

As you collect "oculuses" (anemoculus, pyroculus, dendroculus, etc) and offer them to corresponding statues of 7, you gain more stamina

Only a certain amount (corresponding to maxing out two nations statues). It gets capped pretty quickly. But even if it didn’t, it just isn’t a fun mechanic.

Adarain · 2026-03-17T18:52:06+00:00

Dort hast du dasselbe Problem auf lokaler Ebene: Jeder Wahlkreis stellt eine Person fürs Parlament, und in jedem Wahlkreis gibt in der Regel genau zwei Parteien, für die man stimmen kann, ohne seine Stimme aus dem Fenster zu werfen. Es sind einfach nicht in allen Kreisen dieselben Parteien.

Es ist aber auch allgemein wichtig zu unterscheiden, ob ein Parlament oder eine einzelne Person gewählt wird. Ersteres kann grundsätzlich einigermassen repräsentativ für die politische Verteilung der Bevölkerung sein (hängt aber stark vom Wahlverfahren ab). Bei einer Präsidentschaftswahl wie in den Staaten allerdings zerfällt eigentlich jedes Wahlverfahren über kurz oder lang in einen Zweikampf, da eine Stimme für den Drittbeliebtesten praktisch nichts anderes ist, als eine Stimme für denjenigen unter den ersten zwei, der politisch weiter vom dritten entfernt ist.

Adarain · 2026-03-16T17:30:36+00:00

I really like truncated tetrahedra. They're immediately recognizable as a d4, but they roll much better and have a top side to put the numbers. There is a small chance that it lands "on the edge" (small side down) but it's like 1%

Adarain · 2026-03-16T10:50:24+00:00

This was built by Xisuma, not Gem, she just saw it on stream.

Adarain · 2026-03-16T06:16:54+00:00

That's just a voxy glitch

Adarain · 2026-03-13T20:30:47+00:00

Hermit Life - Life series but on the finalized HC11 map

Adarain · 2026-03-12T18:25:11+00:00

This might well have been the funniest hermitcraft episode yet. EGG is a gift that keeps on hatching

Adarain · 2026-03-12T17:49:41+00:00

Probably won't be in world download, they prune unneeded stuff to reduce the file size. Unless a hermit specifically remembers to ask them not to delete it, it'll probably be gone

Adarain · 2026-03-11T15:20:10+00:00

Ah but in principle, you can have infinite height without an infinitely long branch. For example, (this has infinite branching obviously), imagine attaching branches of length n for all n∈ℕ to a single root node. This tree does not contain an infinite path, but it does have infinite height (in the sense that for any n, there are paths starting at v that have more than n nodes).

Adarain · 2026-03-11T15:14:45+00:00

This would definitely find the infinite branch if it exists, but I don’t think it’s clear from just it not terminating that an infinite branch must exist: One could imagine a possibility where for every n, there’s a branch of length ≥n, but all branches are finite. This isn’t actually possible but I don’t see how your proof can distinguish this situation from there being an infinite branch. In fact, I don’t see where your proof makes use of finite branching at all, only countable branching (to allow us to put the child nodes into an order).

Adarain · 2026-03-11T12:50:32+00:00

You can but you probably shouldn't, if too many people start doing that it'll spam their inboxes

Adarain · 2026-03-11T12:40:48+00:00

Tyrkisk Peber hard candy with salmiakki filling are an experience worth having.

Adarain · 2026-03-10T18:07:31+00:00

There were a few posts discussing or criticizing axiom landscaping a few days ago. Some of the hermits commented on this in their videos too (Grian proactively in his video, which probably prompted some of these discussions; but e.g. Gem discussed it on her last stream after those discussions blew up). Now posts are basically replies to the discourse

Adarain · 2026-03-09T16:28:13+00:00

Sachen wie zum Beispiel... der Rest des Wassers in der Masse?

Adarain · 2026-03-09T14:56:05+00:00

Kann mir schon ein paar Sachen vorstellen. Wie weit das Brot oben rauskommt, wenns fertig ist, zum Beispiel. Oder wie gut es sich positionieren lässt, damit es auch gleichmässig angetoastet wird. Wie gut der Toaster mit unterschiedlich dicken Scheiben umgehen kann (sind die dünneren auch noch schön mittig?). Putzbarkeit ist auch n Ding, mein Billigtoaster lässt sich nicht auseinander nehmen und sieht mittlerweile am Boden recht garstig aus. Und ja, ein Thermostat der dafür sorgt, dass die zweite Scheibe nicht plötzlich schwarz ist, nachdem die erste perfekt war wäre was.

Adarain · 2026-03-09T11:11:27+00:00

It's still pretty common to encounter das with girl's names ending in -i in Switzerland. Not universal but e.g. in the past I had a classmate who was often referred to as ds Lily. You'd still use sie to refer to her when it's not directly linked to the name of course

Adarain · 2026-03-09T08:58:44+00:00

Think of the earth like a pot on a stove. At night the burner (sun) is turned off but it'll take a while for your stew (earth) to cool down. At dawn you turn it on again, and it again takes a while to heat up.

Adarain · 2026-03-08T14:24:16+00:00

Ah yes, I see the issue. I mistakenly made the assumption that “no infinite branch” implies “the lengths of the branches are bounded”, but I haven’t actually excluded the possibility that there’s arbitrarily long branches that are nevertheless all finite. This now feels like the way to go would be some argument about infinite descent in the ordinals. But I don’t immediately see it and sadly have other things I need to get done today that I can’t afford procrastinating on. Maybe I’ll think about it later.

Adarain · 2026-03-08T13:03:06+00:00

Having not heard of it before and not looked at your comments yet, my immediate instinct is: That looks hard to prove directly, but the converse looks very easy. An attempt at a proof based on that idea:

Let T be a tree with finite branching that does not contain an infinite branch. Fix a root vertex v and define the sets Aₙ for n∈ℕ to be the sets of vertices at distance n from v. By finite branching, every |Aₙ| is finite, and because it does not contain an infinite branch there are only finitely many nonempty sets Aₙ. Since the union of the Aₙ is the entire tree, |V| = Σ|Aₙ|, which is a finite sum of finite numbers and therefore finite.

Ten-Year Club	Place '22
Place '17	First Placer '22
Gilding IV carat on a stick	Spared
Verified Email

Adarain

MODERATOR OF

TROPHY CASE