> It's is the latest symptom of a long preoccupation with these beautiuful mathematical objects.
It's not just a beautiful concept, they have other uses too. It turns out some patterns can be pretty efficient for search if there is a spatial movement cost.
Some questions that interest me:
1. Can you get these search patterns as part of an emergent behaviour?
2. Can multiple searchers work together in order to produce these patterns efficiently?
3. Instead of searching linear 2D and 3D space, what if you want to search non-linear spaces?
Reminds me of an unfinished game I did long time ago: https://www.youtube.com/watch?v=aTtX8CavRTk
It also had a 3D mode. Unfortunately it was too difficult to understand what was going on and most play testers were just confused, instead of having fun. :)
That looks really cool, though confusing even though I do understand Hilbert curves. I’m having a very difficult time intuiting the strategy for a game like this. I think the core concept is very interesting though.
I used Hilbert curves for data locality in a distributed system a few years back. It’s great for optimizing range queries across multi-dimensional data. Does your implementation use SIMD for the bit-interleaving? I remember that being the main bottleneck we hit when generating keys on the fly.
> It's is the latest symptom of a long preoccupation with these beautiuful mathematical objects.
It's not just a beautiful concept, they have other uses too. It turns out some patterns can be pretty efficient for search if there is a spatial movement cost.
Some questions that interest me:
1. Can you get these search patterns as part of an emergent behaviour?
2. Can multiple searchers work together in order to produce these patterns efficiently?
3. Instead of searching linear 2D and 3D space, what if you want to search non-linear spaces?
Reminds me of an unfinished game I did long time ago: https://www.youtube.com/watch?v=aTtX8CavRTk It also had a 3D mode. Unfortunately it was too difficult to understand what was going on and most play testers were just confused, instead of having fun. :)
That looks really cool, though confusing even though I do understand Hilbert curves. I’m having a very difficult time intuiting the strategy for a game like this. I think the core concept is very interesting though.
Written in Rust, with cross-platform + web visualiser in egui.
I used Hilbert curves for data locality in a distributed system a few years back. It’s great for optimizing range queries across multi-dimensional data. Does your implementation use SIMD for the bit-interleaving? I remember that being the main bottleneck we hit when generating keys on the fly.