next »

[gimymblert]

https://www.oxpal.com/procedural-stylized-textures.html
Creating Stylized Textures the Procedural Way

[gimymblert]

Deep Learning for Game Developers

[gimymblert]

Computer Generates Human Faces

[JobLeonard]

Figured this might have some use to some of the game devs out there:

https://beta.observablehq.com/@jobleonard/shuffle-vectors

(I can't believe this is a novel data structure, it's so simple it feels like it should have been discovered ages ago)

"Crossposting" since randomization and ProcGen go hand-in-hand.

[gimymblert]

Unity3d Procedural Generation of Buildings with a custom Unity script and custom inspector

[gimymblert]

Figured this might have some use to some of the game devs out there:

https://beta.observablehq.com/@jobleonard/shuffle-vectors

(I can't believe this is a novel data structure, it's so simple it feels like it should have been discovered ages ago)

"Crossposting" since randomization and ProcGen go hand-in-hand.

I'm looking for an "instant" (O1) random shuffle, ie a "seeded bijective random hash" of indexes, do you know any? I think the term is "perfect random hashing" but the one I found generally only apply on the bit length, not custom array length.

[JobLeonard]

If you include initialization, I don't think you really can get better than O(n).

Can you elaborate on the use-case?

[BorisTheBrave]

I think the term is "perfect random hashing" but the one I found generally only apply on the bit length, not custom array length.

I mean, if you have a shuffle over the first n integers, you can construct a shuffle over the first m integers, m < n, as follows:

Code:

def m_shuffle(i):
  i = n_shuffle(i)
  while i >= m:
    i = n_shuffle(i)
  return i

It's still amortized constant time, and hash quality shouldn't be too much lower if m and n are similar.

[gimymblert]

I'm late, no internet, but the use case is basically infinite universe in the quintillion range, O(n) is not applicable, I was just wondering if there was hash for random length instead of the full bit range.

A typical application would be to create a random range (like population) and use the " instant random shuffling hash" to be sure it is random "enough" so that we don't have obvious pattern in distribution. Especially in "simulated simulation" where I hash npc schedule randomly, so that we don't have npc always being in the same layout (ie home neighbor end up in sequential order in job seat).

But anyway It's not in a hurry, I still have to deal with hairtech™ but I'm currently following a mandatory training in webdesign.

[BorisTheBrave]

If the range of values in the quintillion, you don't need to care about perfect hashing - collisions are nigh impossible anyway. Even if you let users search through your infinite universe, they won't be able to find any cases where things are broken.

I was just wondering if there was hash for random length instead of the full bit range.

Isn't that exactly what I showed you?

[gimymblert]

If the range of values in the quintillion, you don't need to care about perfect hashing - collisions are nigh impossible anyway. Even if you let users search through your infinite universe, they won't be able to find any cases where things are broken.

This effect is call "pcg echo" and there was a talk somewhere i can't find back where it was discussed as happening fairly often despite what the number would suggest. Player aren't "collision", they actually spread through the possibility space, it's the same mistake the dev of no man's sky got into when they said meeting another player will be rare, but they did it the first day. I think it's because random is not uniform and tend to exhibit clump, and the player "spread" increase the range likelihood of "collision", couple with that we are very very good at spotting pattern.

I was just wondering if there was hash for random length instead of the full bit range.

Isn't that exactly what I showed you?

I meant O(1) isn't what you showed O(n) (due to the while loop)? I'm not sure I'll have to take another deep look at it lol

[gimymblert]

Technical Artist Bootcamp: Introduction to Proceduralism

[Crimsontide]

This effect is call "pcg echo" and there was a talk somewhere i can't find back where it was discussed as happening fairly often despite what the number would suggest. Player aren't "collision", they actually spread through the possibility space, it's the same mistake the dev of no man's sky got into when they said meeting another player will be rare, but they did it the first day. I think it's because random is not uniform and tend to exhibit clump, and the player "spread" increase the range likelihood of "collision", couple with that we are very very good at spotting pattern.

That wasn't because of the birthday paradox (https://en.wikipedia.org/wiki/Birthday_problem)?

[BorisTheBrave]

Adding a while loop doesn't automatically make this O(n). In this case, it is amortized O(1), with a simple proof.

That wasn't because of the birthday paradox (https://en.wikipedia.org/wiki/Birthday_problem)?

Yep, spot on. But a quintillion is *really big*, 10^18. That means you need to sample a *billion* random items before there is a 50% odds of finding a collision between any pair. So even with the birthday paradox, collisions are going to be quite rare.

[gimymblert]

Designing A Comprehensive Color System

[gimymblert]

https://www.theregister.co.uk/2019/02/14/open_ai_language_bot/
Roses are red, this is sublime: We fed OpenAI's latest chat bot a classic Reg headline

[gimymblert]

https://twitter.com/Makan_Gilani
animation experiment

[gimymblert]

https://github.com/watabou/TownGeneratorOS
Medieval Fantasy City Generator
https://watabou.itch.io/medieval-fantasy-city-generator?fbclid=IwAR2M8-xZr0tJWJQoobi3xjlCxmnM6GKG5RcB-sYdyyN8vfcQl24r-Xog4Y0


https://www.jigsawplanet.com/?rc=createpuzzle&ret=%2F%3Frc%3Dplay%26pid%3D2c3b2fac35c6
puzzle

[gimymblert]

Generative Modeling with Modifiers (Blender 2.

[gimymblert]

Raising Atreus for Battle in God of War

follow up tp the list starting here:
https://forums.tigsource.com/index.php?topic=48415.msg1386904#msg1386904