Post #2993834
2026-01-19 12:26 UTC
@MxVerda@lgbtqia.space @johnnythan@tuebingen.network @ArchiteuthisFlux@leds.social
Google failed me. Here is some pseudocode:
Variables
bug location x, y
food location x, y
100x100 grid
Bug location x = rnd * 100
Bug location y = rnd * 100
Calculate distance from bug to food, using Pythagoras
https://byjus.com/maths/distance-formula/
The faint smell excites the bug: the _more_ excited the bug, the _slower_ it moves. More excitement = shorter stride
Stride = 1/distance
Search:
Pick a random direction
Move 1 stride that direction
Sniff
Calculate new stride length: if the smell is stronger, move shorter
If bug(x,y) = food(x,y) exit
Otherwise, go search
End
Replies (1)
-
@lproven@social.vivaldi.net 2026-01-19 12:29
@MxVerda@lgbtqia.space @johnnythan@tuebingen.network @ArchiteuthisFlux@leds.social The result of this is that the bug, *which can't sense the direction of the food*, usually finds it in about 10 paces or so. It's fascinating to watch, and it looks just like the lighthouse seeking run, which conservatively using an LLM in the cloud, would run several _trillions_ of lines of code to get there, counting Linux distros in VMs, an orchestrator, and some language models.