KayleMaster wrote: ↑Fri Dec 29, 2017 12:08 pm Can this be used as a pathfinding alternative for grid based games?

Well this technically isn't pathfinding: https://en.wikipedia.org/wiki/Boids
The grid here exists so only entities within a certain range will be iterated.
But you could get creative and use this combined with other algorithms.

Haven't been able to code properly for sometime, finally got access to my own laptop.
Here's a new one.

local row_mt = { __index = function(self,k) local cell = {} self[k] = cell cell[self] = true return cell end, __mode = "v" } local matrix_mt = { __index = function(self,k) local row = setmetatable({},row_mt) self[k] = row row[self] = true return row end, __mode = "v" } matrix = ...

Thank you! I was unfamiliar to GLSL. That step function is going to be handy!

What I'm aiming for: https://forums.tigsource.com/index.php?topic=40832.msg1363742#msg1363742 My code so far: extern Image img; extern vec2 img_size; vec4 effect(vec4 color, Image texture, vec2 texture_coords, vec2 screen_coords) { vec4 pixel = Texel(texture, texture_coords); screen_coords = mod(scr...

--==List==-- local list = {} list.__index = list list.__len = function(self) return self.size end list._init = function(self) self.p,self.n = {},{} self.size = 0 self.current = false self.p[self] = self self.n[self] = self end list.has = function(self,item) if not item or item == self or not self.p...

Can binser serialize weak tables?

https://github.com/kikito/bresenham.lua ... senham.lua

I understand what the bresenham algorithm is and how it works, but I just cannot wrap my head around why this code actually works.

Is it possible to register custom classes that don't use libraries you mentioned? I prefer to create classes on a case by case basis, so don't use outside libraries.

Just a visual toy. Made for fun.