s-macke

25 ms·

1. 271.▲
   by s-macke 8y ago

   This happens to me when I use the Internet Explorer. My best guess is, that the problem is, that the game tries to use all the computing power available. The game does use the "setTimeout(Loop, 0)" trick to accomplish this. Usuall
2. 272.▲
   by s-macke 8y ago

   Thanks for the tips. There are always ways to improve the gameplay. I had still 2-3kB left at the end. When I designed the buildings I thought actually about "Save New York" on the C64. https://www.youtube.com/watc
3. 273.▲
   by s-macke 8y ago

   I watched the video. It doesn't look like liquid but something else. Some strange particle effects. But maybe I am wrong.
4. 274.▲
   by s-macke 8y ago

   I played this game too. And I was close trying to implement such a game. But then my fluid grid would be much much larger and the game much slower. I thought about adaptive grids. Fine on the viewing screen and coarse outside. But to implem
5. 275.▲
   by s-macke 8y ago

   The problem with higher speeds were instabilities in the numerics. So I reduced the internal time step. Never tried to increase the speed again after solving a few of those problems.
6. 276.▲
   by s-macke 8y ago

   Do you see the green bar on the speed indicator on the right side?
7. 277.▲
   by s-macke 8y ago

   I increased the timestep by a factor of two. Have fun https://simulationcorner.net/js13kgame/
8. 278.▲
   by s-macke 8y ago

   On my computer the game runs at 40 FPS. So there is still room and I can increase the timestep if you want. This game simulates the Navier-Stokes equation on a grid of the size 256x128. Four times the size would already reduce the game to 1
9. 279.▲
   by s-macke 8y ago

   Exactly. This is at the moment nothing more than a nice technical demonstration. Actually my initial code implemented already mechanics for rotations. But then I skipped this feature for this entry. I was afraid the game gets too hard for l
10. 280.▲
    by s-macke 8y ago

    That is exactly what I am asking. So far I haven't seen such a game. But I think it is easy doable with a few changes. I will remember it as a possible idea for a game entry next year.
11. 281.▲
    by s-macke 8y ago

    Actually no. I found them by googling. You can find more tricks in my utils file. https://github.com/s-macke/Interplanetary-Postal-Service/blo... I guess you can read an explanation on a similar problem here: htt
12. 282.▲
    by s-macke 8y ago

    Thanks stared. I forked the repository and will make a pull request. Also I have seen your quantum game project.
13. 283.▲
    by s-macke 8y ago

    There is a trick in level 7. You have to do something counterintuitive.
14. 284.▲
    by s-macke 8y ago

    Well, only the games/projects count which I would add to the readme. And sorry, I have to say no here.
15. 285.▲
    by s-macke 8y ago

    Maybe one of the more interesting technical aspects is the usage of WebAssembly here. I used Emscripten, so the main part is written in plain C. But I threw away all the JavaScript overhead and used just the plain size optimized wasm file.
16. 286.▲
    by s-macke 8y ago

    Author here. It started as a technical demonstration for fluid dynamics in the web browser. Then I saw the js13kgames competition and the decision was made to make a game out of it. A game in which the fluid mechanic counts. The decision fo
17. 287.▲
    Show HN: Lunar lander-type game with computational fluid dynamics(github.com)

    660 points by s-macke 8y ago|127 comments
18. 288.▲
    by s-macke 8y ago

    Interesting. Under what circumstances are they broken?. Inf, NaN?
19. 289.▲
    by s-macke 8y ago

    You might as well use WebAssembly for the task. C and C++ have good native complex number support.
20. 290.▲
    by s-macke 8y ago

    Looks like the code is handwritten in the webassembly assembler language [1]. [1] https://github.com/remko/waforth/blob/master/src/waforth.wat
21. 291.▲
    by s-macke 8y ago

    Show them this video: https://www.youtube.com/watch?v=cNxadbrN_aI
22. 292.▲
    by s-macke 8y ago

    I can tell you in a few hours. But it would be easier if you provide me the correct compile options to produce such a small binary for trivial functions. Target was of course the webassembly target.
23. 293.▲
    by s-macke 8y ago

    In C for webassembly I can access the provided memory directly, which leads to the following unusual code. char *m = NULL; m[1] = 0xFF; For m[0] the compiler exchanges the code with the abort function :-) I wonder, if something similar is p
24. 294.▲
    by s-macke 8y ago

    I just programmed a function, which added 2 numbers and compiled it and got a huge binary. But maybe I did something wrong. I will try again. Thanks.
25. 295.▲
    by s-macke 8y ago

    I am still a little bit disappointed that most transpiled languages have to provide a litte operating system to run their code including memory management and garbage collection. With this overhead webassembly can be even much slower than J
26. 296.▲
    Top Continuous Integration Tools (2017)(stackify.com)

    1 points by s-macke 8y ago|0 comments
27. 297.▲
    by s-macke 8y ago

    Tensorflow tries to fit the free parameters (usually millions of parameters) of a function y=f(x). The fitting algorithm gets usually thousands or millions of examples of how the output y for a given input x has to look like. For example, x
28. 298.▲
    by s-macke 8y ago

    The „Voxel Space“ engine from the 90th has only very little to do with what we call voxel today. It it basically a raycasting engine for height maps [0]. It is very limited. You can‘t look up and down more than 20 degrees and you can‘t even
29. 299.▲
    Oracle plans to dump risky Java serialization(infoworld.com)

    260 points by s-macke 8y ago|155 comments
30. 300.▲
    by s-macke 8y ago

    As long as cash is available, it is difficult to charge penalty interest on your bank account.