Ancestors

Toot

Written by Marc B. Reynolds on 2024-12-06 at 14:44

Tossed together a gist of tomfoolery:

1. generate a random number with a given population count (portable, bisection method)

2. perform a random bit permutation of the input. (needs PDEP or SAG like op in hardware to be usable)

3. not quite random versions of (2)

4. use (2) or (3) to produce stateful variants of (1)

https://gist.github.com/Marc-B-Reynolds/45a1742df711a1046981b8221311d1b4

=> More informations about this toot | More toots from mbr@mastodon.gamedev.place

Descendants

Written by demofox on 2024-12-06 at 14:47

@mbr what's a population count in this context?

=> More informations about this toot | More toots from demofox@mastodon.gamedev.place

Written by Marc B. Reynolds on 2024-12-06 at 14:51

@demofox The number of set bits in the integer.

=> More informations about this toot | More toots from mbr@mastodon.gamedev.place

Written by demofox on 2024-12-06 at 14:59

@mbr oh neat, ok! :)

=> More informations about this toot | More toots from demofox@mastodon.gamedev.place

Written by demofox on 2024-12-06 at 15:48

@mbr if I had a genie, I'd wish that the bits were in a non clumping pattern, and that each permutation was "very different" from the last, and that it worked in a 2D tile 😂.

Then thered be a nice spatiotemporal "sparse rendering" pattern :P

=> More informations about this toot | More toots from demofox@mastodon.gamedev.place