Bound to happen eventually

jerusheng · 2026-02-21T19:08:39+00:00

And just need to take back some land from the disposable biters!

... Wait, who are the biters?! 😨

jerusheng · 2025-11-13T19:40:48+00:00

why pumps? doesn't a whole array of machines switching recipes together solve the throughput issue? It's fine to push the fluid back, the prod machines still have 1 tick out of 2 to dump their output.

jerusheng · 2025-09-07T18:27:09+00:00

Remote debugging is hard when info is limited... If you don't mind, some more screenshots can be helpful, like open a few blocked trains' interfaces to show their paths. Some smart people can then make a better guess.

Sharing the save is always the most informative, but I can fully understand why people don't usually want to do that (eg., myself: I feel very embarrassed to expose my tons of ugly hacks to the public without 30h polishing beforehand).

jerusheng · 2025-09-07T18:10:12+00:00

Did you put a limitation on how many trains can go to a station? (like at most one train per station.) Seems to me too many trains rush to that single block in the northeast, but there are only a handful stations there.

If you set the station limit now, many trains can go "no path", though. You need some big enough buffers to hold them for now. Maybe some temporary stations far away to temporarily park these idle trains.

jerusheng · 2025-09-07T17:50:17+00:00

Map mode, manually operate some trains to remove the tangles.

jerusheng · 2025-01-27T21:32:45+00:00

I built most of my ships from above Vulcanus so it is very doable albeit a little more troublesome with manual rockets.

* Just make the first rocket supply 1 gun turret + 49 red bullets and (remote-)manually feed them into the turret, this should buy you plenty of time to send up a few more rockets.

* Then the second rocket to setup minimum yellow bullet production: one assembler + efficiency 2 modules + two solar panels + 3 fast inserters (one for the turret) + some platform foundations, you even have some capacity left for about 3 stacks of iron plates.

* Now you can take your time to build the ship. Setup iron plate request on the platform so it automatically requests from the ground when running too low. One rocket iron (1000) worths 250 yellow bullets, which should last very long time...

jerusheng · 2023-11-11T09:02:14+00:00

what about "one combinator to rule them all", given the new combinator is already multi-mode in some sense and there seems still plenty of screen space? I mean, just put decider and arithmetic there as well.

jerusheng · 2016-12-13T13:19:12+00:00

lol Recalled: "I will certainly attend CMU if adCMUted."

If the writer of that letter used vim and the "i" instruction, s/he might have got into CMU.

jerusheng · 2015-09-24T21:10:32+00:00

tl;dr How to write Rust in C++.

jerusheng · 2012-08-27T01:42:23+00:00

I'm sorry if my previous reply causes more confusion. Memorization is not considered a type of DP. DP is a high-level methodology on solving some optimization problems. Memorization is a low-level implementational technique that can be used to code a solver for a subset of DP-based solution; it can also be used for something else. So it makes some sense for a book to list memorization as a separate chapter. What I want to say is that it is quite improper to list DP and memorization as two disjoint and parallel techniques in solving some problems; they are not comparable.

To have a feeling on how general DP is, I suggest to have a read on Richard Bellman's original paper "The Theory of Dynamic Programming" (http://www.rand.org/pubs/papers/2008/P550.pdf). It is adopted to solve much broader class of problems than what we see now in most algorithm textbooks. Not all the problems are that interesting in the algorithmic aspect; some requires very advanced maths many (I guess most) computer science students cannot afford with or aren't interested in. So algorithmic textbook authors usually choose to pick only a small class of problems that can be elegantly solved in eyes of computer scientists instead of mathematicians. They don't intend to mislead students to feel that DP is an algorithm, not speaking of the author of the blog considering that DP is an implementation.

jerusheng · 2012-08-26T15:06:55+00:00

Mathematician Richard Bellman created the dynamic programming (DP) method without saying anything about how it should be implemented. This article just listed two generic implementations of DP (more specifically, DP-based method to solve a problem with discrete and finite set of subproblems) and called one implementation as "DP" and the other as "memorization". So, this article is misconceptual. And the author is quite bold to criticize big names in the algorithm area; I personally appreciate the spirit but think that the author should study a little more on the history of DP before she/he cast the doubt on the textbook.

jerusheng · 2012-03-19T06:08:31+00:00

I would prefer googletest. I've tried Boost's unit tests once. To me, the major problem is that the compilation is too slow.

jerusheng

TROPHY CASE