Game Information
Author:
impo
Rating:
Unrated
Type:
Example
Genre:
pathfinding
Submited:
2019-02-12 11:49:08
Download:
Source

Active Users
13 guests

Recent Games

A* pathfinding for enigma

A* pathfinding for enigma
all of the A* examples on gml i found didn't work with enigma so i made this one. it generates a graph and shortest path between selected nodes

A* algorithm finds the shortest path on graph. the gml's mp_potential is based on A* algorithm, nevertheless, although the A* is intended for graphs,  to make mp_potential simple to use, it implements A* on grid (by creating a node in each cell of the grid). this is resource intensive and impractical if you want a game with thousands of npc. instead you'd have to make a node based pathfinding.
ive made a few tests and enigma kills game maker 50x with this one.
Screenshots:
Screenshot

Comments
okay, this thing is outdated as i largely rewrote the whole thing and optimized it to perform better in enigma. gonna upload cooler example later
Posted by impo on 2019-02-19 13:36:28#1