ashdnazg

7 ms·

31.
by ashdnazg 1y ago
argv[0]
32.
by ashdnazg 1y ago
I thought it's like hopping onto a bus. Then it doesn't take a lot for "hop" to change into "jump".
33.
by ashdnazg 1y ago
A bit of a niche game: https://www.mobygames.com/game/63804/socher-hayam/ Although it has cult status in Israel for some reason.
34.
by ashdnazg 1y ago
Thank you! It's similar with Turbo Pascal 3.0, but there's only one segment since it's a good old COM file. The compiler just copies its own first ~10000 bytes, comprising the standard library, and splices the compiled result
35.
by ashdnazg 1y ago
I'm writing a decompiler for Turbo Pascal 3.0, to reverse engineer an educational game from the 80s. Since TP 3.0 does no optimisations, and looking at the progress so far (~25% decompiled), it seems like matching decompilation should
36.
by ashdnazg 1y ago
That's a good point, the matter of timing different fleets from different sources to arrive at the same time is definitely an operational challenge. I think it's a bit difficult to describe a game as purely strategic/operatio
37.
by ashdnazg 1y ago
I also thought about this type of game! I have more experience with the discrete version - e.g., Konquest[0]. I think it's not very operational, as getting your ships to battle is as simple as saying go from A to B. Your operational ch
38.
by ashdnazg 1y ago
With AVX512 (and to a lesser extent with AVX2) one can implement 256 bit addition pretty efficiently with the additional benefit of fitting more numbers in registers. It looks more or less like this: __m256i s = _mm256_add_epi64(a, b);
39.
by ashdnazg 1y ago
Competition works because the more successful a company is, the more resources it gets (money from the customers). If a free Linux distribution is more successful, its resources don't scale accordingly.
40.
by ashdnazg 1y ago
I think he meant verbs, and specifically how you say things like "could have done" - the order of "hätte machen können".
41.
by ashdnazg 1y ago
I'm glad I walked Hadrian's Wall Path before this happened. Close to the midpoint you're walking up and down a bunch of small but steep hills and valleys, when a huge tree appears in the next valley. It was really a memorable
42.
by ashdnazg 1y ago
I don't understand the higher performance either. What I know as the significant advantage is that you can have one object in multiple lists.
43.
by ashdnazg 2y ago
More like 10000 [1] [1] https://en.m.wikipedia.org/wiki/Kawara,_Fukuoka
44.
by ashdnazg 2y ago
Pretty sure it's optimisations. Even small things like converting multiplications followed by additions to FMA will reduce the operation count. Add to that constant folding etc. and a speedup factor of ~3 is not so hard to imagine.
45.
by ashdnazg 2y ago
I think I only recently learned that there are two different Steve Jacksons. The founder of Steve Jackson Games and creator of Munchkin and GURPS [0] The writer of Fighting Fantasy and founder of Games Workshop and Lionhead Studios [1] I fi
46.
by ashdnazg 2y ago
Ooh, I also did the compile-to-WASM side quest! There are some really fun optimizations one can do to make the emulation run faster. It's orders of magnitude faster than my naive hand-written emulator.
47.
by ashdnazg 2y ago
Asymptotic analysis is only relevant if you have some series (or a function). The series 0.9, 0.99, 0.999,... is asymptotically close to 1 and also asymptotically close to 0.9999... (with infinite 9s), since for any epsilon, I can find an i
48.
by ashdnazg 2y ago
I'm sometimes tuning accordions, which is rather similar, but if you want to lower the tone by a lot, you can plop some solder close to the tip of the reed. It's pretty clear why that's the opposite of filing off material clo
49.
by ashdnazg 2y ago
In the Spring/Recoil RTS game engine[1] we adapted Lua to have deterministic execution allowing synchronous multiplayer simulation. In addition we relatively easily implemented a precise[2] serialization of the Lua VM, allowing us to s
50.
by ashdnazg 2y ago
I think you mean Coagulation[1]. I remember playing this map with a bunch of friends and two split screen TVs. Hearing somebody swear at you from the neighbouring room is a wonderful experience. [1] https://halo.fandom.com/w
51.
by ashdnazg 2y ago
I used it in a few game jams and can thoroughly recommend it. The interface might be intimidating at first, but with two wave generators and a couple of patterns you can already conjure a passable background track. A bit more complexity and
52.
by ashdnazg 2y ago
In my case it definitely didn't (so far). I'm not a prolific writer and the subjects are just what interested me at that point in time and I feel should be public. Unfortunately, there aren't many companies looking for expert
53.
by ashdnazg 2y ago
The article's definition of not revealing information is a bit unclear, but if we understand it as Eve not knowing who holds any single card, your solution seems to work. At least assuming the following code is correct :) import iterto
54.
by ashdnazg 2y ago
Yes. For instance, if a player says the sum of their cards is 3, Eve immediately knows they have cards 0, 1 and 2.
55.
Solving Super Six(ashdnazg.github.io)
3 points by ashdnazg 2y ago|0 comments
56.
by ashdnazg 2y ago
Our CI posts a list of shame with the 10 worst offending expressions on every PR as part of the build and test results. So far it's working quite nicely. Every now and then you take a look and notice that your modules are now at the to
57.
by ashdnazg 2y ago
Note that it's not 100x faster than C, but than bend running on one CPU thread. Running the equivalent C code takes ~2.3 seconds on my machine. Same order of magnitude as bend on the beefy GPU.
58.
by ashdnazg 3y ago
Each row has 3^3=27 options, which doesn't fit in 4 bits.
59.
Encoding tic-tac-toe in 13 bits(ashdnazg.github.io)
3 points by ashdnazg 3y ago|2 comments
60.
by ashdnazg 3y ago
This code encodes a board into [0, 6045] which fits in 13 bits: https://gist.github.com/ashdnazg/5cca7de6bac0eef4532d0c635c6... It follows the principle that one can represent a board by choosing k filled spots from 9

More ›