Coding Adventure: Boids

this is so amaing

And if you have the golden ratio... there is a closed form solution for the nth number in the Fibonacci sequence. Deriving that was fun...

what is the language used here?

I think I might actually cry, I have become emotionally attached to the fishies and they were on screen for not even 30 seconds

Awesome

Your voice is so calming it actually helps me sleep haha

I don't know if they are Boids, they look more like Feesh!

Btw the fin on the top of the submarine is going the wrong way when you turn

FIMSHIES!!!🙀🙀😼😼

Swirling patterns like in galaxies... 🤔

Can you make one on using quantum mechanics to generate maps

What IDE is being used, could you tell me please?

Very inspiring to watch + cool result + cute dog profile picture = perfection.
Thanks for creating this

So the golden ratio would be, the ratio of the entire line to the bigger segment is the same as the ratio between the bigger segment to the smaller one. Symmetry. Does it work like a fractal then to keep from colliding as the smaller segment becomes A + B or is that just completely not how it works?

14 years ago, I tried creating a modified boids system with different personalities which affected the cohesiveness of the flock. It worked perfectly apart from the obstacle avoidance and now you may have given me the ability to close that chapter of my life!

...kind of lost your mind for about 3 minutes in the middle there. 😅

Fun math fact, the golden ratio isn't a property of the Fibonacci sequence itself, it's a property of the recursion that defines it.

F(n) = F(n-1) + F(n-2) can be solved by converting it to its characteristic equation x^2 = x + 1, and solving x^2 - x - 1 = 0 gives you the golden ratio!

So this tells us F(n) = A(phi^n) + B(phi^(-n)) for some constants A and B that depend on the initial conditions for the recursion.

That means we can approximate F(n) ≈ A(phi^n), so F(n)/F(n-1) = A(phi^(n))/(A(phi^(n-1))) = phi.

Or use limits and be more precise.

I worked with Craig at my last company!

Probably either started or had this finished by Saturday (it was posted on a Monday) because Saturday is for the Boids

During all your trials and attempts... Ever feel like the exact opposite of Oppenheimer's "I am become death"?
For you have become evolution.

Boids i.e Birds from New York

Thank you, this was very helpfull in creating my own collision detection system for fish ai "not boids just singular fish"

muito bom!

FYI: Fish spines mostly bend left and right, not up and down.

I love boids

An additional property that might be cool is if they see something moving that isn't a boid they run away.

yY ihave imvu3d and i have myprincess named account andiamn dame offshersonl yXXzZn seikkailen siellä paljon _btw${}££¥₩$ 11 0;::,.*71=12333!??,;:::-',....qQQpåÅlll.jal . ,niimävaa uuen ajan ehkäp wp tm s innercirclen chätistä aenima anD lanata lostris reaL hm c TEOSTO ftP3XxxCjkkkl qNDe etr SddAfFG hjjk lkl.

Wow! That's amazing!

I'll have to go back to elementary school😁

are display drones basically BOIDS IRL?!?!
edit: nvm, their positions are preprogrammed, but still a cool idea imo

Better fish-AI than COD: Ghosts

Do i need unity to use this code?
I dont want to download and setup unity just to look at and play with this

Instead of dividing into chunks to check for closest neighbor, you can use a K-D tree. The advantage of this is you can get the closest boid even if it isn't in a nearby chunk.

What program was this made on?

Like a storm of birds in the sky...

Soooo cool. What programming environment is this in?

you are an inspiration

boid is my new favorite word. yes, it beats pnuemenoultramicroscopicsilicovolcanoconiosis

Man, I really enjoy your content. Pure professional and pleasant.

This will also be useful for stimulating bat flocks; note that cave bats exit caves by flying in an anticlockwise direction; guess why that is!

hello? did you just create a black hole by FLIPPING THE EQUATION UPSIDE DOWN?!

This still looks like so much fun!

I read your source code and I have to admit it's quite impressive! However, I believe there are a couple of aspects that could be improved. Firstly, it seems like a memory barrier or similar mechanism was not used in your computer shader, which could result in potential write/read disorder. Secondly, the fixed thread count of 1024 for each local group may not align with the number of Boids, possibly leading to duplicate computations.

I wonder why you didn't just do a distance check from the nearest point on the obstacle collider? Surely that'd eat up less processing power than several raycasts for each boid?

Unsubbed mrbeast subbed here, much chiller and fullfilling

Damn, you are incredible

can anyone explain how to start going from lines of code to simulation like this? my coding knowledge is far from being able to do something like this, but i was wondering how you choose or find packages or write guis that allow you to simulate things like this.