Gregory's Server
|
Inspired by @neauoire’s recent post I took a crack at my own version of paradise. Drawing is sloppy but choosing to keep it anyway.  on october 20th i'll be giving a lightning talk called "Uxn: Permacomputing & Roguelikes" https://www.roguelike.club/event2024.html (i'm also putting together a roguelike demo that i hope to have ready to show by then) if you've struggled to program music using uxn/varvara, this file might help you to get started: https://git.phial.org/d6/nxu/raw/branch/main/music.tal it deals with some of the common pitfalls around timing and de-sync. it still won't be easy but at least it might be easier? 😅 kodiak version 1 is done! there are still some things i'd like to add later but for a #uxn solitaire game this is fairly complete. splash screen ✔️ get the ROM and source code here: https://git.phial.org/d6/kodiak sickos.jpg: https://git.phial.org/d6/nxu/raw/branch/main/uxntal.1 (read with `man ./uxntal.1`) @d6 oh my! this is so great. Could you make a patch to some of the repos? I think this would be good for everyone to have around :uxn: @d6 I AM LOVING THIS THING I think the non-imm opcode proper is BRK, it could be BRK* * has no modes. my #uxn klondike game ("kodiak") is finally working! https://git.phial.org/d6/kodiak/ it is very stripped down (no splash screen, no sounds, no animations, no fun) but it's complete enough that i just won my first game! some small known issues/clunkiness but it should be playable if you want to try it out. it seems like the name "impatience" has already been used by many, so the new working title for my #uxn klondike program is "kodiak" it's still very rough but at least the layout should be recognizable
Show previous comments
come to [a-z]{3}langs! we've got: - conlangs this is not as cool as i had hoped because it just hardcodes the first 14 terms of the continued fraction for pi, i.e. 3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1 (i did implement a generalized continued fraction which isn't hardcoded, but (A) it converges much more slowly and (B) it doesn't actually find the "best" convergents (e.g. 355/113) so it just didn't seem very useful.) i have rational numbers mostly-implemented in modal. example: > (str (mul (Q (+ sixteen ten)) (Q (- sixteen ten)))) https://git.phial.org/d6/modal/src/branch/d6/binary/arith.modal#L378 i just can't seem to stop. i think computable real numbers will be possible too. here's the current version of binary arithmetic on natural numbers in #modal: https://paste.sr.ht/~d6/92210f8df9c7fe2045fded40798ecd94fa5c632d supports: still some rough edges but it works well for fairly large numbers. on my machine it takes about 33s to compute 13^13; there is still a lot of room for optimization. language by @wryl website describing modal by @neauoire: https://wiki.xxiivv.com/site/modal implementation i'm using: https://git.sr.ht/~rabbits/modal spent an hour playing with modal [1] and now i have a partial implementation of little-endian binary numbers (comparison, addition, and multiplication): https://paste.sr.ht/~d6/caa78ae7cb08355efbcbd241a2b6278889762adc @d6 Oh wow! Seeing your magic touch with modal makes me so happy! Do you use nil as a type marker? @wryl also started exploring binary representation and arithmetic, have a look! https://paste.sr.ht/~rabbits/a49d01434dadcf618dd7a950325eb3a1f2c5d587 "i'm fine" i tell myself as i continue to scroll through the R⁷RS [1] standard. [1] Revised⁷ Report on the Algorithmic Language Scheme (https://r7rs.org/)  @d6 I studied R5RS in school, and while it's just two more, that "7" hit me like a truck. PR to add uxntal to github's linguist library: https://github.com/github-linguist/linguist/pull/6648 in addition to github this library is also used by codeberg, forgejo, gitea, and other systems. having uxntal support there will be nice. |
