this FOV thing could be interesting, probably storing pre-computed data could help if created when map is created, by storing farest tiles only to keep memory usage low, and flood fills are fast realtime - farest tiles are blocking floodfill.

its like you are suggesting
Everything is precomputed and stored in the main data struct. The slow thing is the visibility computing. The grid shown in the video tooks more than half hour to compute. Too much for my spects. I am looking for a way to speed it up...

I am working on smiley wars!
I created/creating a new ai typ: a dragon ^^

Take a look at him

hehh
that's really slow. what is the x,y grid size?
maybe the computation should be less precise, like measuring only from tile middle to tile middle without taking into account slightly touched tiles...

128x96 cells. The main problem is that every line scan iterates with every wall line and I can't imagine how to filter them. My Known choices are multithreading and searching over the net xP

Are you familiar with common visibility structures like BSP-trees, ABTs, etc? If not I would recommend you to read some papers.

it's not so big, so imo it should be much faster even if c_tracing is used. and yes, there are some fine articles (I have never taken a really deep look into this topic, but will need something similar for my future AI developments)

Yes, I know what they are and how they work but never intended to code them. The documents I found speak about derivatives and integrals and it have past 15 years from I learned them. Right now I feel too lazy to relearn them, it totally looses its amusement

Dungeon Generator

to be honest, what I really don't like to play are dungeon games