Over the past couple of weeks, I’ve spent entirely longer than I probably should have falling down the rabbit hole that is the game Turing Complete.
In a nutshell, you start with basically nothing, build up simple logic gates, create memory cells and 1-bit addition, build that into 8-bit math and logic, read instructions RAM, implement loops, and function calls (in hardware!), and eventually use your very own custom built CPU to solve a few programming challenges.
Ludum Dare? That’s been a while!
I didn’t actually enter the game jam. Honestly, I wasn’t sure I was going to write anything. But I had a bit of an idea and spent a few hours only on Sunday hammering something out:
Yeah, I did another cellular automata thing 😄
It’s not at all complete, but the basic idea is:
It’s sort of got that?
I’m using Rust as I’ve been doing a lot recently.
The main libraries are:
rwh_05 to be properly compatible with pixels, which took a minute to track downOther than, that, it’s straight custom code which you can see in it’s entirety on my github.
update function; with generation in newI think that perhaps the only really interesting bit about the code is how the ‘shine waves’ work. Basically, I have a grid of the state of each cell, but I also have a Vec that tracks ‘active’ pixels. Those are the only ones that can update–which both helps performance and makes the simulation appear the way it does.
Overall, a nice quick project. More than anything, it actually convinced me to try setting up something that can render pixel buffers on Rust. And with a (very minimal) GUI, too! Both things I’ve been meaning to learn.
I probably won’t do anything more with this code, but it’s got the seeds of something more interesting. Keep an eye out. 😄
Onward!
Simulate Tetris on a 7 wide board with a given (infinitely repeated) series of left and right inputs to be applied on each frame before dropping the block and a given (infinitely repeated) set of blocks. Once 2022 blocks have been dropped, what is the total height of the placed blocks?
What feels like a million years and a lifetime ago, I wrote up a library for perlin and simple noise in Racket. Inspired by Jens Axel Søgaard’s new Sketching library (processing in Racket) and a conversation thereabout, I figure it’s about time to push noise to the raco package manager!
And so it ends.
| Category | Place | Score | Ratings |
|---|---|---|---|
| Overal | 282nd | 3.688 | 26 |
| Fun | 408th | 3.438 | 26 |
| Innovation | 17th | 4.28 | 27 |
| Theme | 290th | 3.917 | 26 |
| Graphics | 608th | 3.313 | 26 |
| Audio | 436th | 3.182 | 24 |
| Humor | 761st | 2.205 | 24 |
| Mood | 529th | 3.208 | 26 |
As part of Ludum Dare, you’re supposed to review games. Here are some of my favorites (in the order I reveiwed them, so no particular order).
Controls:
Goals:
EDIT: I have included a v1.1 update that fixes a few minor bugs. Feel free to play either the official v1.0 build or the slightly updated (~10 minutes) v1.1 build with:
And there you have it. This page will serve as the main entry for Ludum Dare. If you’d rather download an executable for Windows/OSX/Linux, you can do so on the GitHub release page:
Speaking of which, per the Ludum Dare rules (and because I would have anyways), the full source code:
MIT Licensed. I would appreciate a comment if you do anything cool with it.
Ludum Dare page, if you’d like to see my entry:
Some updates since last time:
I made a game y’all!
Big changes:
Got some sleep and BACK AT IT!
Big changes: