This will be a tiny post.

I’m excited since I got 2 artificial intelligence algorithms working. Both are related to graph navigations on a discrete world (depth and breadth first search). One of them with a fun twist to get different paths each time it gets called.

Both work ok, one finds the least nodes route (not always the shortest length) and the other finds a random one (sometimes the shortest path, others the least nodes, etc.)

Now it’s time to get into tree’s algorithms so I may get the path with the less length and variations from it.

Probably I’ll be publishing a demo within a couple of weeks… I’m really happy… and tired hahahaha

I know some of you guys are used to these algorithms, I’m not so I’m proud of myself.